New Quantum Cryptographic Primitives I
summary
Survey of concrete proposals for mini-scheme public-key quantum money: banknotes are subspace states verified by membership tests and a Fourier-check, with attacks on many early candidates and oracle-based proofs (Aaronson–Christiano) that give unconditional security but fail when instantiated. Two proof strategies highlighted: quantum lightning (forcing unpredictable serials) and reducing real to a fake world via subspace-hiding obfuscation plus indistinguishability obfuscation; constructions are candidates, some broken, and key open problems (gap-LWE variant, post-quantum SHO) remain.
AI-written summary · about
chapters (15)
- 0:00Start
- 1:44The Quantum no Cloning Theorem
- 3:00Public Key Quantum Money
- 7:00Random Oracle Model
- 7:19Superposition Attacks
- 8:26Quantum Money
- 13:37Why Why Is Quantum Money So Hard
- 17:55Proofs Relative to Oracles
- 29:53Short Integer Solution
- 35:35Strategies To Justify Security
- 38:01How Do I Verify Banknotes
- 40:47Subspace Hiding Obfuscation
- 47:57Obfuscation
- 49:38Mathematical Obfuscation
- 1:03:30Takeaways
