arXiv:quant-ph/0402170

Unconditional Security of Practical Quantum Key Distribution

Hermen Jan Hupkes

Published Feb 23, 2004• 4 citations

Abstract

We present an extension of the first proof for the unconditional security of the BB84 quantum key distribution protocol which was given by Mayers. We remove the constraint that a perfect BB84 quantum source is required and the proof given here covers a range of practical quantum sources. Nothing is assumed about the detector except that the efficiency with which signals are detected is basis independent.

DOI: 10.48550/arxiv.quant-ph/0402170

Related papers

Unconditional Security of Practical Quantum Key Distribution

Inamori, H, Lütkenhaus, N, Dominic Mayers

We present a complete protocol for BB84 quantum key distribution for a realistic setting (noise, loss, multi-photon signals of the source) that covers many of todays experimental implementations. The security of this protocol is shown against an eavesdropper having unrestricted power to manipulate the signals coherently on their path from sender to receiver. The protocol and the security proof take into account the effects concerning the finite size of the generated key.

Jul 3, 2001231 citations

Unconditional security in quantum cryptography

Dominic Mayers

Basic techniques to prove the unconditional security of quantum crypto graphy are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard [1984]. The proof considers a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission. Each individual signal sent into the channel must contain a single photon or any two-dimensional system in the exact state described in the protocol. No restriction is imposed on the detector used at the receiving side of the channel, except that whether or not the received system is detected must be independent of the basis used to measure this system.

arXiv:quant-ph/9802025Journal of the ACMMay 1, 20011,036 citations

Security of quantum key distribution with imperfect devices

Daniel Gottesman, Hoi‐Kwong Lo, Norbert Lütkenhaus +1 more

This paper prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the source and detector are under the limited control of an adversary. This proof applies when both the source and the detector have small basis-dependent flaws, as is typical in practical implementations of the protocol. The estimation of the key generation rate in some special cases: sources that emit weak coherent states, detectors with basis-dependent efficiency, and misaligned sources and detectors.

IEEE International Symposium on Information Theory (ISIT)Dec 23, 2004251 citations

Secure Quantum Key Distribution with an Uncharacterized Source

Masato Koashi, John P. Preskill

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol for an arbitrary source whose averaged states are basis independent, a condition that is automatically satisfied if the source is suitably designed. The proof is based on the observation that, to an adversary, the key extraction process is equivalent to a measurement in the sigma(x) basis performed on a pure sigma(z)-basis eigenstate. The dependence of the achievable key length on the bit error rate is the same as that established by Shor and Preskill [Phys. Rev. Lett. 85, 441 (2000)]] for a perfect source, indicating that the defects in the source are efficiently detected by the protocol.

arXiv:quant-ph/0208155Physical Review LettersFeb 6, 2003164 citations

Security of quantum key distribution with imperfect devices

Daniel Gottesman, Hoi-Kwong Lo, N. L\"utkenhaus +1 more

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the source and detector are under the limited control of an adversary. Our proof applies when both the source and the detector have small basis-dependent flaws, as is typical in practical implementations of the protocol. We derive a general lower bound on the asymptotic key generation rate for weakly basis-dependent eavesdropping attacks, and also estimate the rate in some special cases: sources that emit weak coherent states with random phases, detectors with basis-dependent efficiency, and misaligned sources and detectors.

Quantum Information and ComputationSep 1, 2004723 citations

Composable Security of Generalized BB84 Protocols Against General Attacks

Michel Boyer, Rotem Liss, Tal Mor

Quantum key distribution (QKD) protocols make it possible for two parties to generate a secret shared key. One of the most important QKD protocols, BB84, was suggested by Bennett and Brassard in 1984. Various proofs of unconditional security for BB84 have been suggested, but the first security proofs were not composable. Here we improve a security proof of BB84 given by [Biham, Boyer, Boykin, Mor, and Roychowdhury, J. Cryptology, 19(4):381-439, 2006] to be composable and match the state-of-the-art results for BB84, and we extend it to prove unconditional security of several variants of the BB84 protocol. Our composable security proof for BB84 and its variants is mostly self-contained, algebraic, and relatively simple, and it gives tight finite-key bounds.

arXiv:2208.12154Aug 25, 20222 citations