Relativistic or 2 Prover 1 Round Zero Knowledge Protocol for NP Secure Against Quantum Adversaries

Relativistic or 2 Prover 1 Round Zero Knowledge Protocol for NP Secure Against Quantum Adversaries

TheIACR via YouTube Direct link

Open questions Composability of such schemes.

13 of 13

13 of 13

Open questions Composability of such schemes.

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Relativistic or 2 Prover 1 Round Zero Knowledge Protocol for NP Secure Against Quantum Adversaries

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Initial motivation
  2. 2 Motivation (2)
  3. 3 Concrete example: Sigma protocols
  4. 4 Sigma protocols (2) - How to go from 1 to 2 challenges?
  5. 5 Quantum consecutive measurements
  6. 6 Recap of the problem
  7. 7 Main theorems
  8. 8 Tightness of the bounds.
  9. 9 Application of the bound Proofs of knowledge
  10. 10 Construction
  11. 11 Relativistic Fobit commitment
  12. 12 ZK protocol for Hamiltonian Cycle (informal) . Given a graph G. does there exista closed path going thought al nodes without using the same edge twice?
  13. 13 Open questions Composability of such schemes.

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.