Quantum 4
Talkat Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 · 2025-05-19..05-23·
summary
Quantum commitments and many other primitives can plausibly exist without one-way functions: oracle separations show pseudorandom state implies commitments and that quantum commitments exist relative to quantum or classical oracles even if BQP = QMA or P = NP, respectively. Constructions go from quantum one-way states to one-way puzzle -> commitments by converting many-state copies into classical shadows and proving inversion remains hard. A separate line reduces average-case hardness of output probabilities (permanent / boson sampling / random circuits) to one-way puzzles. Open: base commitments on weaker worst-case assumptions (e.g., P ≠ PSPACE).
AI-written summary · about
chapters (8)
- 0:00Quantum cryptography assumptions
- 2:33Quantum key distribution
- 4:01Pseudorandom states in quantum
- 16:50Quantum cryptographic primitives
- 23:31One-way state generators
- 37:49One-way puzzles in quantum
- 43:48Building puzzles from quantum advantage
- 53:14Open problems in quantum crypto
related talks
48mCommitments to Quantum States
12mOne-Way Functions Imply Secure Computation in a Quantum World
34mQuantum Minimalism
59mQuantum cryptography and quantum complexity
01h 08mNew Quantum Cryptographic Primitives II
46mObfuscation of Unitary Quantum Programs
01h 00mFunctional Commitments
59mAn Introduction to Quantum Obfuscation
