Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9806008 · Physical Review A

Estimates for practical quantum cryptography

Norbert Lütkenhaus

Published May 1, 1999• 219 citations
arXivHTMLPDF

Abstract

In this paper I present a protocol for quantum cryptography which is secure against attacks on individual signals. It is based on the Bennett-Brassard protocol of 1984. The security proof is complete as far as the use of single photons as signal states is concerned. Emphasis is placed on the practicability of the resulting protocol. For each run of the quantum key distribution the security statement gives the probability of a successful key generation and the probability for an eavesdropper's knowledge, measured as change in Shannon entropy, to be below a specified maximal value.

DOI
10.1103/physreva.59.3301

Related papers

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/9802025•Journal of the ACM•May 1, 2001•1,036 citations

Security proof of practical quantum key distribution schemes

Yodai Watanabe

This paper provides a security proof of the Bennett-Brassard (BB84) quantum key distribution protocol in practical implementation. To prove the security, it is not assumed that defects in the devices are absorbed into an adversary's attack. In fact, the only assumption in the proof is that the source is characterized. The proof is performed by lower-bounding adversary's Renyi entropy about the key before privacy amplification. The bound reveals the leading factors reducing the key generation rate.

arXiv:quant-ph/0506246•Jun 29, 2005•0 citations

Security of quantum key distribution with entangled photons against individual attacks

Edo Waks A, Assaf J. Zeevi, Y. Yamamoto

We investigate the security of quantum key distribution with entangled photons, focusing on the two-photon variation of the Bennett-Brassard 1984 (BB84) protocol proposed in 1992 by Bennett, Brasard, and Mermin (BBM92). We present a proof of security which applies to realistic sources, and to untrustable sources which can be placed outside the labs of the two receivers. The proof is restricted to individual eavesdropping attacks, and assumes that the detection apparatus is trustable. We find that the average collision probability for the BBM92 protocol is the same as that of the BB84 protocol with an ideal single-photon source. This indicates that there is no analog in BBM92 to photon splitting attacks, and that the source can be placed between the two receivers without changing the form of the collision probability. We then compare the communication rate of both protocols as a function of distance, and show that BBM92 has potential for much longer communication distances, up to 170 km, in the presence of realistic experimental imperfections. Finally, we propose a scheme based on entanglement swapping that can lead to even longer distance communication. The limiting factor in this scheme is the channel loss, which imposes very slow communication rates at longer distances.

arXiv:quant-ph/0012078•Physical Review A•Apr 25, 2002•260 citations

Security against individual attacks for realistic quantum key distribution

Norbert Lütkenhaus

I prove the security of quantum key distribution against individual attacks for realistic signals sources, including weak coherent pulses and down-conversion sources. The proof applies to the Bennett-Brassard 1984 protocol with the standard detection scheme (no strong reference pulse). I obtain a formula for the secure bit rate per time slot of an experimental setup, which can be used to optimize the performance of existing schemes for the considered scenario.

arXiv:quant-ph/9910093•Physical Review A•Apr 6, 2000•749 citations

Practical security of quantum cryptography

Lars Lydersen

The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an eavesdropper can do anything permitted by the laws of physics. Measuring the quantum properties of the signals generating the key, would ultimately change them, and thus reveal the eavesdropper’s presence. This exchange of a random, secret key is known as quantum cryptography.\n\nQuantum cryptography can be, and has been proven unconditionally secure using perfect devices. However, when quantum cryptography is implemented, one must use components available with current technology. These are usually imperfect. Although the security of quantum cryptography has been proven for components with certain imperfections, the question remains: can quantum cryptography be implemented in a provable, unconditionally secure way, using components available with current technology? This thesis contains both a theoretical, and an experimental contribution to the answer of this question. On the experimental side, components used in, and complete quantum cryptography systems have been carefully examined for security loopholes. In particular, it turned out that two commercial quantum cryptography systems contained loopholes, which would allow an eavesdropper to capture the full secret key, without exposing her presence. Furthermore, this detector control attack could be implemented with current technology. The attack is applicable against a variety of quantum cryptography implementations and protocols.\n\nThe theoretical contribution consists of security proofs for quantum cryptography in a very general setting. Precisely, the security is proven with arbitrary individual imperfections in the source and detectors. These proofs should make it possible to use a wide array of imperfect devices in implementations of quantum cryptography.\n\nFinally, a secure detection scheme is proposed, immune to the detector control attack and compatible with those security proofs. Therefore, if this scheme is implemented correctly, it offers provable security.

•Jan 1, 2011•4 citations

Security of two quantum cryptography protocols using the same four qubit states

Cyril Branciard, Nicolas Gisin, Barbara Kraus +1 more

The first quantum cryptography protocol, proposed by Bennett and Brassard in 1984 (BB84), has been widely studied in recent years. This protocol uses four states (more precisely, two complementary bases) for the encoding of the classical bit. Recently, it has been noticed that by using the same four states, but a different encoding of information, one can define a protocol which is more robust in practical implementations, specifically when attenuated laser pulses are used instead of single-photon sources [V. Scarani et al., Phys. Rev. Lett. 92, 057901 (2004), referred to as the SARG04 protocol]. We present a detailed study of SARG04 in two different regimes. In the first part, we consider an implementation with a single-photon source: we derive bounds on the error rate $Q$ for security against all possible attacks by the eavesdropper. The lower and the upper bound obtained for SARG04 ($Q\ensuremath{\lesssim}10.95%$ and $Q\ensuremath{\gtrsim}14.9%$, respectively) are close to those obtained for BB84 ($Q\ensuremath{\lesssim}12.4%$ and $Q\ensuremath{\gtrsim}14.6%$, respectively). In the second part, we consider a realistic source consisting of an attenuated laser and improve on previous analysis by allowing Alice to optimize the mean number of photons as a function of the distance. The SARG04 protocol is found to perform better than BB84, both in secret-key rate and in maximal achievable distance, for a wide class of Eve's attacks.

arXiv:quant-ph/0505035•Physical Review A•Sep 1, 2005•146 citations
In this paper I present a protocol for quantum cryptography which is secure against attacks on individual signals. It is based on the Bennett-Brassard protocol of 1984. The security proof is complete as far as the use of single photons as signal states is concerned. Emphasis is placed on the practicability of the resulting protocol. For each run of the quantum key distribution the security statement gives the probability of a successful key generation and the probability for an eavesdropper's knowledge, measured as change in Shannon entropy, to be below a specified maximal value.
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.
This paper provides a security proof of the Bennett-Brassard (BB84) quantum key distribution protocol in practical implementation. To prove the security, it is not assumed that defects in the devices are absorbed into an adversary's attack. In fact, the only assumption in the proof is that the source is characterized. The proof is performed by lower-bounding adversary's Renyi entropy about the key before privacy amplification. The bound reveals the leading factors reducing the key generation rate.
We investigate the security of quantum key distribution with entangled photons, focusing on the two-photon variation of the Bennett-Brassard 1984 (BB84) protocol proposed in 1992 by Bennett, Brasard, and Mermin (BBM92). We present a proof of security which applies to realistic sources, and to untrustable sources which can be placed outside the labs of the two receivers. The proof is restricted to individual eavesdropping attacks, and assumes that the detection apparatus is trustable. We find that the average collision probability for the BBM92 protocol is the same as that of the BB84 protocol with an ideal single-photon source. This indicates that there is no analog in BBM92 to photon splitting attacks, and that the source can be placed between the two receivers without changing the form of the collision probability. We then compare the communication rate of both protocols as a function of distance, and show that BBM92 has potential for much longer communication distances, up to 170 km, in the presence of realistic experimental imperfections. Finally, we propose a scheme based on entanglement swapping that can lead to even longer distance communication. The limiting factor in this scheme is the channel loss, which imposes very slow communication rates at longer distances.
The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an eavesdropper can do anything permitted by the laws of physics. Measuring the quantum properties of the signals generating the key, would ultimately change them, and thus reveal the eavesdropper’s presence. This exchange of a random, secret key is known as quantum cryptography.\n\nQuantum cryptography can be, and has been proven unconditionally secure using perfect devices. However, when quantum cryptography is implemented, one must use components available with current technology. These are usually imperfect. Although the security of quantum cryptography has been proven for components with certain imperfections, the question remains: can quantum cryptography be implemented in a provable, unconditionally secure way, using components available with current technology? This thesis contains both a theoretical, and an experimental contribution to the answer of this question. On the experimental side, components used in, and complete quantum cryptography systems have been carefully examined for security loopholes. In particular, it turned out that two commercial quantum cryptography systems contained loopholes, which would allow an eavesdropper to capture the full secret key, without exposing her presence. Furthermore, this detector control attack could be implemented with current technology. The attack is applicable against a variety of quantum cryptography implementations and protocols.\n\nThe theoretical contribution consists of security proofs for quantum cryptography in a very general setting. Precisely, the security is proven with arbitrary individual imperfections in the source and detectors. These proofs should make it possible to use a wide array of imperfect devices in implementations of quantum cryptography.\n\nFinally, a secure detection scheme is proposed, immune to the detector control attack and compatible with those security proofs. Therefore, if this scheme is implemented correctly, it offers provable security.
The first quantum cryptography protocol, proposed by Bennett and Brassard in 1984 (BB84), has been widely studied in recent years. This protocol uses four states (more precisely, two complementary bases) for the encoding of the classical bit. Recently, it has been noticed that by using the same four states, but a different encoding of information, one can define a protocol which is more robust in practical implementations, specifically when attenuated laser pulses are used instead of single-photon sources [V. Scarani et al., Phys. Rev. Lett. 92, 057901 (2004), referred to as the SARG04 protocol]. We present a detailed study of SARG04 in two different regimes. In the first part, we consider an implementation with a single-photon source: we derive bounds on the error rate QQQ for security against all possible attacks by the eavesdropper. The lower and the upper bound obtained for SARG04 ($Q\ensuremath{\lesssim}10.95%$ and $Q\ensuremath{\gtrsim}14.9%$, respectively) are close to those obtained for BB84 ($Q\ensuremath{\lesssim}12.4%$ and $Q\ensuremath{\gtrsim}14.6%$, respectively). In the second part, we consider a realistic source consisting of an attenuated laser and improve on previous analysis by allowing Alice to optimize the mean number of photons as a function of the distance. The SARG04 protocol is found to perform better than BB84, both in secret-key rate and in maximal achievable distance, for a wide class of Eve's attacks.