Quantum Information Meets Cryptography
summary
Classical position verification is impossible but using BB84 states gives a provably unclonable route: one verifier sends BB84 qubits, the other sends bases, and two separated adversaries cannot both recover the secret. Practical issues—authenticating quantum payloads and high error rates—drive two fixes: coset states add public authentication so verifiers can check states, and construction from NTCFs produces unclonable states via purely classical interaction so verifiers stay classical while the prover remains quantum, yielding a fault-tolerant, implementable PV protocol.
AI-written summary · about
chapters (12)
- 0:00Intro
- 0:34No-Cloning Principle
- 0:52Classically Impossible Primitives
- 2:00Example: Position Verification
- 2:59Distance Bounding
- 7:21Position Verification TFKW'13
- 8:02Security
- 9:27Drawbacks
- 12:06PV with Authentication
- 12:45Fault Tolerant
- 13:45PV with Classical Verifiers
- 13:58Conclusion
related talks
32mBeating Classical Impossibility of Position Verification
45mClassical Verification of Quantum Computational Advantage
01h 13mQuantum 3
46mCryptography with Certified Deletion
32mQuantum Obfuscation of Classical Circuits
17mProofs of Quantumness from Trapdoor Permutations
42mTests for "Quantumness"
22mEfficient Formal Verification of Quantum Error Correcting Programs