Optimal attacks on qubit-based quantum key recycling
From MaRDI portal
Abstract: Quantum Key Recycling (QKR) is a quantum-cryptographic primitive that allows one to re-use keys in an unconditionally secure way. By removing the need to repeatedly generate new keys it improves communication efficiency. Skoric and de Vries recently proposed a QKR scheme based on 8-state encoding (four bases). It does not require quantum computers for encryption/decryption but only single-qubit operations. We provide a missing ingredient in the security analysis of this scheme in the case of noisy channels: accurate bounds on the privacy amplification. We determine optimal attacks against the message and against the key, for 8-state encoding as well as 4-state and 6-state conjugate coding. We show that the Shannon entropy analysis for 8-state encoding reduces to the analysis of Quantum Key Distribution, whereas 4-state and 6-state suffer from additional leaks that make them less effective. We also provide results in terms of the min-entropy. Overall, 8-state encoding yields the highest capacity.
Recommendations
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
- A Quantum Cipher with Near Optimal Key-Recycling
- Quantum authentication with key recycling
- Quantum key distribution using multilevel encoding: security analysis
- Study on the security of the authentication scheme with key recycling in QKD
Cites work
- A Quantum Cipher with Near Optimal Key-Recycling
- Correcting errors without leaking partial information
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Graph implementations for nonsmooth convex programs
- How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
- One-and-a-half quantum de Finetti theorems
- One-sided device-independent QKD and position-based cryptography from monogamy games
- OPTIMAL EAVESDROPPING ON NOISY STATES IN QUANTUM KEY DISTRIBUTION
- 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}\)
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
- Quantum Vernam cipher
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Statistical decision theory for quantum systems
- The Operational Meaning of Min- and Max-Entropy
- Uncloneable encryption
Cited in
(6)- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Study on the security of the authentication scheme with key recycling in QKD
- Two-way unclonable encryption with a vulnerable sender
- Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
- Sifting attacks in finite-size quantum key distribution
- Quantum Key Recovery Attacks on 3-Round Feistel-2 Structure Without Quantum Encryption Oracles
This page was built for publication: Optimal attacks on qubit-based quantum key recycling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746889)