Quantum encryption with certified deletion
arXiv:1910.03551 · doi:10.1007/978-3-030-64381-2_4
Abstract
Given a ciphertext, is it possible to prove the deletion of the underlying plaintext? Since classical ciphertexts can be copied, clearly such a feat is impossible using classical information alone. In stark contrast to this, we show that quantum encodings enable certified deletion. More precisely, we show that it is possible to encrypt classical data into a quantum ciphertext such that the recipient of the ciphertext can produce a classical string which proves to the originator that the recipient has relinquished any chance of recovering the plaintext should the decryption key be revealed. Our scheme is feasible with current quantum technology: the honest parties only require quantum devices for single-qubit preparation and measurements; the scheme is also robust against noise in these devices. Furthermore, we provide an analysis that is suitable in the finite-key regime.
28 pages, 1 figure. Some technical details modified
References in corpus (2)
Cited by in corpus (5)
- Quantum repeaters: From quantum networks to the quantum internet
- Generalised entropy accumulation
- Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication
- Composably secure device-independent encryption with certified deletion
- Deletion-Compliance in the Absence of Privacy