Cryptography with Certified Deletion
James Bartusek, Dakshita Khurana

TL;DR
This paper introduces a comprehensive framework for cryptographic primitives with certified deletion, enabling verifiable information-theoretic deletion of encrypted data and enhancing security in quantum and classical settings.
Contribution
It unifies and extends cryptographic primitives with certified deletion, including encryption, commitments, zero-knowledge proofs, and secure computation, with novel proof techniques and security guarantees.
Findings
Framework for certified deletion applicable to various encryption schemes
Construction of commitments with everlasting hiding
Secure computation with everlasting security transfer (EST)
Abstract
We propose a new, unifying framework that yields an array of cryptographic primitives with certified deletion. These primitives enable a party in possession of a quantum ciphertext to generate a classical certificate that the encrypted plaintext has been information-theoretically deleted, and cannot be recovered even given unbounded computational resources. - For X \in {public-key, attribute-based, fully-homomorphic, witness, timed-release}, our compiler converts any (post-quantum) X encryption to X encryption with certified deletion. In addition, we compile statistically-binding commitments to statistically-binding commitments with certified everlasting hiding. As a corollary, we also obtain statistically-sound zero-knowledge proofs for QMA with certified everlasting zero-knowledge assuming statistically-binding commitments. - We also obtain a strong form of everlasting security…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
