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

Physical Review A

Security of quantum cryptography against individual attacks

Boris A. Slutsky, Ramesh R. Rao, Pang-Chen Sun, Yeshaiahu Fainman

Published Apr 1, 1998• 115 citations
Publisher

Abstract

An attempt to eavesdrop on a quantum cryptographic channel reveals itself through errors it inevitably introduces into the transmission. We investigate the relationship between the induced error rate and the maximum amount of information the eavesdropper can extract, in both the two-state B92 [B92 refers to the work of C. H. Bennett, Phys. Rev. Lett. 68, 3121 (1992)] and the four-state BB84 [BB84 refers to the work of C. H. Bennett and G. Brassard, in Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India (IEEE, New York, 1984), pp. 175--179] quantum cryptographic protocols. In each case, the optimal eavesdropping method that on average yields the most information for a given error rate is explicitly constructed. Analysis is limited to eavesdropping strategies where each bit of the quantum transmission is attacked individually and independently from other bits. Subject to this restriction, however, we believe that all attacks not forbidden by physical laws are covered. Unlike previous work, the eavesdropper's advantage is measured in terms of Renyi (rather than Shannon) information, and with respect only to bits received error-free by Bob (rather than all bits). This alters both the maximum extractable information and the optimal eavesdropping attack. The result can be used directly at the privacy amplification stage of the protocol to accomplish secure communication over a noisy channel.

DOI
10.1103/physreva.57.2383

Related papers

Security of quantum cryptography against individual attacks

Boris A. Slutsky, Ramesh R. Rao, Pang-Chen Sun +1 more

An attempt to eavesdrop a quantum cryptographic channel reveals itself through errors it inevitably introduces into the transmission. We investigate the relationship between the induced error rate and the maximum amount of information the eavesdropper can extract, both in the two-state B92 and the four-state BB84 quantum cryptographic protocols. In each case, the optimal eavesdropping method that on average yields the most information for a given error rate is explicitly constructed. Analysis is limited to eavesdropping strategies where each bit of the quantum transmission is attacked individually and independently form other bits. Subject to this restriction, however, we believe that all attacks not forbidden by physical laws are included. Unlike previous work, the eavesdropper's advantage is measured in terms of Renyi information, and with respect only to bits received error-free by Bob. This alters both the maximum extractable information and the optimal eavesdropping attack. The result can be used directly at the privacy amplification stage of the protocol to accomplish secure communication over a noisy channel.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 1, 1998•0 citations

Security against eavesdropping in quantum cryptography

Norbert Lütkenhaus, Stephen Mark Barnett

In this article we deal with the security of the BB84 quantum cryptography protocol over noisy channels using generalized privacy amplification. For this we estimate the fraction of bits needed to be discarded during the privacy amplification step. This estimate is given for two scenarios, both of which assume the eavesdropper to access each of the signals independently and take error correction into account. One scenario does not allow a delay of the eavesdropper's measurement of a measurement probe until he receives additional classical information. In this scenario we achieve a sharp bound. The other scenario allows a measurement delay, so that the general attack of an eavesdropper on individual signals is covered. This bound is not sharp but allows a practical implementation of the protocol.

arXiv:quant-ph/9711033•Nov 18, 1997•0 citations

Quantum Cryptography Protocol Based on Sending Entangled Qubit Pairs

Olli Ahonen

The quantum key distribution protocol BB84, published by C. H. Bennett and G. Brassard in 1984, describes how two spatially separated parties can generate a random bit string fully known only to them by transmission of single-qubit quantum states. Any attempt to eavesdrop on the protocol introduces disturbance which can be detected by the legitimate parties. In this Master's Thesis a novel modification to the BB84 protocol is analyzed. Instead of sending single particles one-by-one as in BB84, they are grouped and a non-local transformation is applied to each group before transmission. Each particle is sent to the intended receiver, always delaying the transmission until the receiver has acknowledged the previous particle on an authenticated classical channel, restricting eavesdropping to accessing the quantum transmission one particle at a time. Hence, an eavesdropper cannot undo the non-local transformation perfectly. Even if perfect cloning of quantum states was possible the state of the group could not be cloned. We calculate the maximal information on the established key provided by an intercept-resend attack and the induced disturbance for different transformations. We observe that it is possible to significantly reduce the eavesdropper's maximal information on the key--to one eighth of that in BB84 for a fixed, reasonable amount of disturbance. We also show that the individual access to the particles poses a fundamental restriction to the eavesdropper, and discuss a novel attack type against the proposed protocol.

arXiv:0712.4247•Dec 27, 2007•1 citation

Optimal eavesdropping on quantum key distribution without quantum memory

Aurélien Bocquet, Romain Alléaume, Anthony Leverrier

We consider the security of the BB84 (Bennett and Brassard 1984 Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing pp 175–9), six-state (Bruß 1998 Phys. Rev. Lett. 81 3018 ) and SARG04 (Scarani et al 2004 Phys. Rev. Lett. 92 057901 ) quantum key distribution protocols when the eavesdropper does not have access to a quantum memory. In this case, Eve’s most general strategy is to measure her ancilla with an appropriate positive operator-valued measure designed to take advantage of the post-measurement information that will be released during the sifting phase of the protocol. After an optimization on all the parameters accessible to Eve, our method provides us with new bounds for the security of six-state and SARG04 against a memoryless adversary. In particular, for the six-state protocol we show that the maximum quantum bit error ratio for which a secure key can be extracted is increased from 12.6% (for collective attacks) to 20.4% with the memoryless assumption.

arXiv:1106.0329•Journal of Physics A Mathematical and Theoretical•Dec 9, 2011•7 citations

Optimal eavesdropping in quantum cryptography. I. Information bound and optimal strategy

Christopher A. Fuchs, Nicolas Gisin, Robert B. Griffiths +2 more

We consider the Bennett-Brassard cryptographic scheme, which uses two conjugate quantum bases. An eavesdropper who attempts to obtain information on qubits sent in one of the bases causes a disturbance to qubits sent in the other basis. We derive an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis. Independently fixing the error rates in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe. The probe interaction and its subsequent measurement are described explicitly. These results are combined to give an expression for the optimal information an eavesdropper can obtain for a given average disturbance when her interaction and measurements are performed signal by signal. Finally, the relation between quantum cryptography and violations of Bell's inequalities is discussed.

Physical Review A•Aug 1, 1997•475 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
An attempt to eavesdrop on a quantum cryptographic channel reveals itself through errors it inevitably introduces into the transmission. We investigate the relationship between the induced error rate and the maximum amount of information the eavesdropper can extract, in both the two-state B92 [B92 refers to the work of C. H. Bennett, Phys. Rev. Lett. 68, 3121 (1992)] and the four-state BB84 [BB84 refers to the work of C. H. Bennett and G. Brassard, in Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India (IEEE, New York, 1984), pp. 175--179] quantum cryptographic protocols. In each case, the optimal eavesdropping method that on average yields the most information for a given error rate is explicitly constructed. Analysis is limited to eavesdropping strategies where each bit of the quantum transmission is attacked individually and independently from other bits. Subject to this restriction, however, we believe that all attacks not forbidden by physical laws are covered. Unlike previous work, the eavesdropper's advantage is measured in terms of Renyi (rather than Shannon) information, and with respect only to bits received error-free by Bob (rather than all bits). This alters both the maximum extractable information and the optimal eavesdropping attack. The result can be used directly at the privacy amplification stage of the protocol to accomplish secure communication over a noisy channel.
An attempt to eavesdrop a quantum cryptographic channel reveals itself through errors it inevitably introduces into the transmission. We investigate the relationship between the induced error rate and the maximum amount of information the eavesdropper can extract, both in the two-state B92 and the four-state BB84 quantum cryptographic protocols. In each case, the optimal eavesdropping method that on average yields the most information for a given error rate is explicitly constructed. Analysis is limited to eavesdropping strategies where each bit of the quantum transmission is attacked individually and independently form other bits. Subject to this restriction, however, we believe that all attacks not forbidden by physical laws are included. Unlike previous work, the eavesdropper's advantage is measured in terms of Renyi information, and with respect only to bits received error-free by Bob. This alters both the maximum extractable information and the optimal eavesdropping attack. The result can be used directly at the privacy amplification stage of the protocol to accomplish secure communication over a noisy channel.
In this article we deal with the security of the BB84 quantum cryptography protocol over noisy channels using generalized privacy amplification. For this we estimate the fraction of bits needed to be discarded during the privacy amplification step. This estimate is given for two scenarios, both of which assume the eavesdropper to access each of the signals independently and take error correction into account. One scenario does not allow a delay of the eavesdropper's measurement of a measurement probe until he receives additional classical information. In this scenario we achieve a sharp bound. The other scenario allows a measurement delay, so that the general attack of an eavesdropper on individual signals is covered. This bound is not sharp but allows a practical implementation of the protocol.
The quantum key distribution protocol BB84, published by C. H. Bennett and G. Brassard in 1984, describes how two spatially separated parties can generate a random bit string fully known only to them by transmission of single-qubit quantum states. Any attempt to eavesdrop on the protocol introduces disturbance which can be detected by the legitimate parties. In this Master's Thesis a novel modification to the BB84 protocol is analyzed. Instead of sending single particles one-by-one as in BB84, they are grouped and a non-local transformation is applied to each group before transmission. Each particle is sent to the intended receiver, always delaying the transmission until the receiver has acknowledged the previous particle on an authenticated classical channel, restricting eavesdropping to accessing the quantum transmission one particle at a time. Hence, an eavesdropper cannot undo the non-local transformation perfectly. Even if perfect cloning of quantum states was possible the state of the group could not be cloned. We calculate the maximal information on the established key provided by an intercept-resend attack and the induced disturbance for different transformations. We observe that it is possible to significantly reduce the eavesdropper's maximal information on the key--to one eighth of that in BB84 for a fixed, reasonable amount of disturbance. We also show that the individual access to the particles poses a fundamental restriction to the eavesdropper, and discuss a novel attack type against the proposed protocol.
We consider the security of the BB84 (Bennett and Brassard 1984 Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing pp 175–9), six-state (Bruß 1998 Phys. Rev. Lett. 81 3018 ) and SARG04 (Scarani et al 2004 Phys. Rev. Lett. 92 057901 ) quantum key distribution protocols when the eavesdropper does not have access to a quantum memory. In this case, Eve’s most general strategy is to measure her ancilla with an appropriate positive operator-valued measure designed to take advantage of the post-measurement information that will be released during the sifting phase of the protocol. After an optimization on all the parameters accessible to Eve, our method provides us with new bounds for the security of six-state and SARG04 against a memoryless adversary. In particular, for the six-state protocol we show that the maximum quantum bit error ratio for which a secure key can be extracted is increased from 12.6% (for collective attacks) to 20.4% with the memoryless assumption.
We consider the Bennett-Brassard cryptographic scheme, which uses two conjugate quantum bases. An eavesdropper who attempts to obtain information on qubits sent in one of the bases causes a disturbance to qubits sent in the other basis. We derive an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis. Independently fixing the error rates in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe. The probe interaction and its subsequent measurement are described explicitly. These results are combined to give an expression for the optimal information an eavesdropper can obtain for a given average disturbance when her interaction and measurements are performed signal by signal. Finally, the relation between quantum cryptography and violations of Bell's inequalities is discussed.
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.