Two-way unclonable encryption with a vulnerable sender
From MaRDI portal
Abstract: Unclonable Encryption, introduced by Gottesman in 2003, is a quantum protocol that guarantees the secrecy of a successfully transferred classical message even when all keys leak at a later time. We propose an Unclonable Encryption protocol with the additional property that the sender's key material is allowed to leak even in the case of an unsuccessful run. This extra feature makes it possible to achieve secure quantum encryption even when one of the parties is unable to protect its keys against after-protocol theft. Such an asymmetry occurs e.g. in case of server-client scenarios, where the client device is resource-constrained and/or located in a hostile environment. Our protocol makes use of a bidirectional quantum channel in a manner similar to the two-way protocol LM05. Bob sends random qubit states to Alice. Alice flips the states in a way that depends on the message and a shared key, and sends the resulting states back to Bob. Bob recovers Alice's message by measuring the flips. We prove that our protocol satisfies the definition of unclonable encryption and additionally that the message remains secure even if all of Alice's keys leak after the protocol. Furthermore, we show that some of the key material can be safely re-used. Our security proof is formulated in terms of diamond norms, which makes it composable, and allows for noisy quantum channels. We work out the details only for the asymptotics in the limit of long messages. As a side result we construct a two-way QKD scheme with a high key rate. We show that its key rate is higher than the rate of the two-way QKD scheme LM05 proven for the case of independent channel noise.
Recommendations
Cites work
- A Quantum Cipher with Near Optimal Key-Recycling
- Correcting errors without leaking partial information
- Efficient quantum key distribution scheme and a proof of its unconditional security
- Fast computation of GCDs
- scientific article; zbMATH DE number 7651031 (Why is no real title available?)
- Leftover Hashing Against Quantum Side Information
- New hash functions and their use in authentication and set equality
- Optimal attacks on qubit-based quantum key recycling
- Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Theory of Cryptography
- Uncloneable encryption
Cited in
(4)
This page was built for publication: Two-way unclonable encryption with a vulnerable sender
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074431)
