Cryptography with Certified Deletion
summary
Constructs public key encryption and many advanced primitives that produce a classical ciphertext plus a quantum register of BB84 conjugate encodings, where deletion is a concrete operation: measure the qubits in the Hadamard basis, return the outcomes as a certificate and the scheme checks them, i.e. measure-in-Hadamard deletion. Security proof purifies to EPR halves and uses a computational switch plus an efficiently checkable predicate on the challenger side, exploiting EPR-pair purification to show information theoretic erasure; extensions yield CCA, obfuscation, FHE and LWE/SIS based publicly verifiable deletion.
AI-written summary · about
chapters (9)
- 0:00Introduction to the topic
- 2:00Defining certified deletion
- 5:03Applications and primitives
- 8:46Related and concurrent work
- 12:42Quantum background
- 16:21Revocable secret sharing
- 23:45Encryption construction
- 31:41Security proof strategy
- 41:53Advanced results and conclusion
