Quantum Proofs of Deletion for Learning with Errors
summary
Constructs LWE-based public-key and homomorphic encryption schemes that produce a single quantum ciphertext whose Fourier-basis measurement yields a classical short-SIS preimage pi that verifies deletion publicly. Builds on coherent Ajtai hashing and Dual-Regev / Dual-GSW style encodings and introduces a provable property called Gaussian-collapsing under LWE; security for certified deletion requires a stronger conjecture (Strong Gaussian-collapsing). Implements public verification directly; homomorphic variant works with one extra round but relies on the unproven strong collapse.
AI-written summary · about
chapters (10)
- 0:00Quantum Encryption with Certified Deletion
- 2:08Fully Homomorphic Encryption with Certified Deletion
- 3:36Learning with Errors (Regev '05)
- 5:16Short Integer Solution (Ajtai '96)
- 6:33Gaussian superpositions
- 8:05Duality of Gaussian states
- 9:58Dual-Regev public-key encryption with certified deletion
- 14:03Gaussian-Collapsing Hash Functions
- 16:08Strong Gaussian-Collapsing Conjecture
- 19:20Summary
related talks
46mCryptography with Certified Deletion
01h 28mThe Learning With Errors Problem and Cryptographic Applications
58mQuantum 2
01h 13mQuantum 3
01h 15mAlgebraic Lattices and Ring Learning with Errors
01h 07mLattices and Encrypted Computation
32mBeating Classical Impossibility of Position Verification
01h 08mNew Quantum Cryptographic Primitives II
