Lower and Upper Bounds on the Secret-Key Rate for Quantum Key Distribution Protocols Using One-Way Classical Communication
- 15 August 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 95 (8), 080501
- https://doi.org/10.1103/physrevlett.95.080501
Abstract
We investigate a general class of quantum key distribution (QKD) protocols using one-way classical communication. We show that full security can be proven by considering only collective attacks. We derive computable lower and upper bounds on the secret-key rate of those QKD protocols involving only entropies of two-qubit density operators. As an illustration of our results, we determine new bounds for the Bennett-Brassard 1984, the 6-state, and the Bennett 1992 protocols. We show that in all these cases the first classical processing that the legitimate partners should apply consists in adding noise.Keywords
Other Versions
This publication has 12 references indexed in Scilit:
- Distillation of secret key and entanglement from quantum statesProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2005
- Unconditionally Secure Key Distribution Based on Two Nonorthogonal StatesPhysical Review Letters, 2003
- Quantum cryptographyReviews of Modern Physics, 2002
- Simple Proof of Security of the BB84 Quantum Key Distribution ProtocolPhysical Review Letters, 2000
- Incoherent and coherent eavesdropping in the six-state protocol of quantum cryptographyPhysical Review A, 1999
- Optimal Eavesdropping in Quantum Cryptography with Six StatesPhysical Review Letters, 1998
- Optimal eavesdropping in quantum cryptography. I. Information bound and optimal strategyPhysical Review A, 1997
- Quantum cryptography using any two nonorthogonal statesPhysical Review Letters, 1992
- Quantum cryptography without Bell’s theoremPhysical Review Letters, 1992
- Quantum cryptography based on Bell’s theoremPhysical Review Letters, 1991