Cryptography with certified deletion
From MaRDI portal
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 for two-party and multi-party computation in the dishonest majority setting. While simultaneously achieving everlasting security against all parties in this setting is known to be impossible, we introduce everlasting security transfer (EST). This enables any one party (or a subset of parties) to dynamically and certifiably information-theoretically delete other participants' data after protocol execution. We construct general-purpose secure computation with EST assuming statistically-binding commitments, which can be based on one-way functions or pseudorandom quantum states. We obtain our results by developing a novel proof technique to argue that a bit b has been information-theoretically deleted from an adversary's view once they output a valid deletion certificate, despite having been previously information-theoretically determined by the ciphertext they held in their view. This technique may be of independent interest.
Recommendations
- Quantum encryption with certified deletion
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Certified everlasting secure collusion-resistant functional encryption, and more
- Publicly verifiable deletion from minimal assumptions
- Secret sharing with certified deletion
Cites work
- Certified everlasting zero-knowledge proof for QMA
- Coding theorem and strong converse for quantum channels
- Cryptography from pseudorandom quantum states
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Everlasting multi-party computation
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Formalizing data deletion in the context of the right to be forgotten
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 1263182 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- Improving the Security of Quantum Protocols via Commit-and-Open
- Oblivious transfer is in MiniQCrypt
- On statistical security in two-party computation
- One-way functions imply secure computation in a quantum world
- Probabilistically Checkable Arguments
- Quantum commitments and signatures without one-way functions
- Quantum cryptography: public key distribution and coin tossing
- Quantum encryption with certified deletion
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Revocable quantum timed-release encryption
- Sampling in a quantum population, and applications
- Secure multi-party quantum computation with a dishonest majority
- Uncloneable encryption
Cited in
(18)- Publicly-verifiable deletion via target-collapsing functions
- Revocable cryptography from learning with errors
- Publicly verifiable deletion from minimal assumptions
- Certified everlasting secure collusion-resistant functional encryption, and more
- Software with certified deletion
- Unconditionally secure quantum commitments with preprocessing
- Secret sharing with certified deletion
- On one-shot signatures, quantum vs. classical binding, and obfuscating permutations
- Secret sharing with publicly verifiable deletion
- A simple framework for secure key leasing
- Unbounded leakage-resilience and intrusion-detection in a quantum world
- Unclonable non-interactive zero-knowledge
- Non-interactive zero-knowledge arguments with certified deletion
- Publicly verifiable deletion: general compilers from minimal assumptions
- Revocable encryption, programs, and more: the case of multi-copy security
- Proofs of no intrusion
- Collusion-resistant quantum secure key leasing beyond decryption
- Certified everlasting secure collusion-resistant functional encryption, and more
This page was built for publication: Cryptography with certified deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190137)
