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

Conference proceedings - Canadian Conference on Electrical and Computer Engineering

A Survey on Quantum Cryptographic Protocols and Their Security

Chi‐Hang Fred Fung, Hoi‐Kwong Lo

Published Jan 1, 2007• 7 citations
Publisher

Abstract

Communications in secrecy are often required in many commercial and military applications. Unfortunately, many cryptographic schemes in use today such as public-key cryptography based on the RSA algorithm would be broken with either unanticipated advances in hardware and algorithm or the advent of quantum computers. Quantum cryptography, on the other hand, has been proven secure even against the most general attack allowed by the laws of physics and is a promising technology poised for widespread adoption in realistic cryptographic applications. Quantum cryptography allows two parties to expand on a secret key that they have previously shared. Various quantum cryptographic protocols have been proposed to perform this task. In this paper, we survey some popular quantum cryptographic protocols (including the famous Bennett-Brassard 1984 protocol) and discuss their security. Specifically, we consider their security in two cases: the ideal case where a perfect single-photon source is used and the practical case where a realistic laser source is used. We compare the protocols and find that the efficient six-state protocol outperforms the others both in the tolerable quantum bit error rate and in the key generation rate when a realistic laser source is used.

DOI
10.1109/ccece.2007.285

Related papers

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•149 citations

Quantum resistant public key cryptography: a survey

Ray A. Perlner, David A. Cooper

Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based. In this paper, we provide a survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some of the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.

Identity and Trust on the Internet•Apr 14, 2009•143 citations

A survey of quantum key distribution protocols

Mobin Javed, Khurram Aziz

Quantum cryptography offers a promising unbreakable cryptographic solution as it ensures perfect secrecy in applications such as quantum key distribution and bit commitment. The focus of this paper is to trace the development of quantum key distribution protocols and discuss the state of the art and open issues in this field. Although the protocols have mathematically proven to be totally secure, it must be emphasized that any real world implementation suffers the limitations of physical devices which can serve as vulnerability for an eavesdropper to exploit. In this paper, we survey the quantum key distribution protocols which exist in literature and explore the attacks to which they are vulnerable. We highlight the main implementation bottlenecks related with each implementation and the solutions proposed thereof.

International Conference on Frontiers of Information Technology (FIT)•Dec 16, 2009•7 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

Quantum Cryptography

S. Rajasekar, R. Velusamy

Quantum cryptography lies at the intersection of information theory and quantum mechanics. Cryptosystems come in two major classes depending on whether the key is shared in public or in secret. Public key cryptosystems are special in that they allow two people, who have not yet met, to communicate securely by looking-up encryption methods in a public directory. In quantum cryptography, the sender and receiver have two types of communication channels: a classical public channel and a quantum channel. The best application of cryptography is to allow a secure communication. In the near future, quantum cryptography may be used in top-secret applications in the military, for example, as the basis of communication links. The first protocol for quantum cryptography was proposed in 1984 by C. H. Bennett and G. Brassard. Some of the basic quantum cryptographic systems are: four-states protocol, two-states protocol, 4+2 protocol and multi-photon and multi-stage protocol.

CRC Press eBooks•Oct 5, 2022•0 citations

Focus on Quantum Cryptography

Paul G. Kwiat

In our modern era of telecommunications and the Internet, information has become a valuable commodity. Sometimes it must therefore be protected against theft - in this case, loss of secret information to an eavesdropper. Most of today's transactions are protected using encryption unproven to be secure against a computational attack by a classical computer and, in fact, the standardly used encryption algorithms are provably vulnerable to the mind-boggling parallelism of a quantum computer, should one ever be physically realized. Enter quantum cryptography. Underlying nearly all forms of encryption is the necessity for a truly secret key, a random string of zeros and ones; the basic notion of quantum cryptography is to employ single photon transmissions (or the closest attainable approximation to these) to distribute the random key material, while removing the threat of an undetected eavesdropper. Now, nearly twenty years since the seminal quantum cryptography paper by Bennett and Brassard (Bennett C H and Brassard G 1984 Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing (Bangalore) (New York: IEEE) pp 175-9), we take a look at several state-of-the-art implementations, and glimpse how future quantum cryptosystems might look. We start with papers from three of the world's leading experimental quantum cryptography efforts: Stucki et al and Bethune and Risk describe working systems for quantum key distribution (QKD) over telecommunications fibres (at 1550 nanometres and 1300 nanometres, respectively). The former's achievement of quantum key exchange over 67 kilometres of optical fibre is a world record, as is the experimental demonstration by Hughes et al of daylight free-space QKD over a 10 km atmospheric range. Next, Lütkenhaus and Jahma explore the possible vulnerabilities of such systems (which employ attenuated laser pulses instead of actual single photon states) to conceivable future eavesdropping technologies. Enzer et al have implemented a totally new protocol, using polarization-entangled photons, which in some circumstances can tolerate higher error rates than the traditional one of Bennett and Brassard; moreover, the use of entanglement provides a means of `automatic source verification'. Finally, looking to the future, Elliott gives a provocative view of how these technologies may be merged into network operation, and Shapiro describes a method to combine a novel source of entangled photons with a means to transfer the photons' quantum state to trapped-atom quantum memories. If realized, these systems could presage the world's first quantum network. Focus on Quantum Cryptography Contents Quantum key distribution over 67 km with a plug&play system D Stucki, N Gisin, O Guinnard, G Ribordy and H Zbinden Autocompensating quantum cryptography Donald S Bethune and William P Risk Practical free-space quantum key distribution over 10 km in daylight and at night Richard J Hughes, Jane E Nordholt, Derek Derkacs and Charles G Peterson Quantum key distribution with realistic states: photon-number statistics in the photon-number splitting attack Norbert Lütkenhaus and Mika Jahma Entangled-photon six-state quantum cryptography Daphna G Enzer, Phillip G Hadley, Richard J Hughes, Charles G Peterson and Paul G Kwiat Building the quantum network Chip Elliott Architectures for long-distance quantum teleportation Jeffrey H Shapiro Ground to satellite secure key exchange using quantum cryptography J G Rarity, P R Tapster, P M Gorman and P Knight Method for decoupling error correction from privacy amplification Hoi-Kwong Lo Paul G Kwiat University of Illinois at Urbana-Champaign, USA

New Journal of Physics•Jul 12, 2002•9 citations
Communications in secrecy are often required in many commercial and military applications. Unfortunately, many cryptographic schemes in use today such as public-key cryptography based on the RSA algorithm would be broken with either unanticipated advances in hardware and algorithm or the advent of quantum computers. Quantum cryptography, on the other hand, has been proven secure even against the most general attack allowed by the laws of physics and is a promising technology poised for widespread adoption in realistic cryptographic applications. Quantum cryptography allows two parties to expand on a secret key that they have previously shared. Various quantum cryptographic protocols have been proposed to perform this task. In this paper, we survey some popular quantum cryptographic protocols (including the famous Bennett-Brassard 1984 protocol) and discuss their security. Specifically, we consider their security in two cases: the ideal case where a perfect single-photon source is used and the practical case where a realistic laser source is used. We compare the protocols and find that the efficient six-state protocol outperforms the others both in the tolerable quantum bit error rate and in the key generation rate when a realistic laser source is used.
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.
Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which currently used public key cryptographic algorithms are based. In this paper, we provide a survey of some of the public key cryptographic algorithms that have been developed that, while not currently in widespread use, are believed to be resistant to quantum computing based attacks and discuss some of the issues that protocol designers may need to consider if there is a need to deploy these algorithms at some point in the future.
Quantum cryptography offers a promising unbreakable cryptographic solution as it ensures perfect secrecy in applications such as quantum key distribution and bit commitment. The focus of this paper is to trace the development of quantum key distribution protocols and discuss the state of the art and open issues in this field. Although the protocols have mathematically proven to be totally secure, it must be emphasized that any real world implementation suffers the limitations of physical devices which can serve as vulnerability for an eavesdropper to exploit. In this paper, we survey the quantum key distribution protocols which exist in literature and explore the attacks to which they are vulnerable. We highlight the main implementation bottlenecks related with each implementation and the solutions proposed thereof.
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.
Quantum cryptography lies at the intersection of information theory and quantum mechanics. Cryptosystems come in two major classes depending on whether the key is shared in public or in secret. Public key cryptosystems are special in that they allow two people, who have not yet met, to communicate securely by looking-up encryption methods in a public directory. In quantum cryptography, the sender and receiver have two types of communication channels: a classical public channel and a quantum channel. The best application of cryptography is to allow a secure communication. In the near future, quantum cryptography may be used in top-secret applications in the military, for example, as the basis of communication links. The first protocol for quantum cryptography was proposed in 1984 by C. H. Bennett and G. Brassard. Some of the basic quantum cryptographic systems are: four-states protocol, two-states protocol, 4+2 protocol and multi-photon and multi-stage protocol.
In our modern era of telecommunications and the Internet, information has become a valuable commodity. Sometimes it must therefore be protected against theft - in this case, loss of secret information to an eavesdropper. Most of today's transactions are protected using encryption unproven to be secure against a computational attack by a classical computer and, in fact, the standardly used encryption algorithms are provably vulnerable to the mind-boggling parallelism of a quantum computer, should one ever be physically realized. Enter quantum cryptography. Underlying nearly all forms of encryption is the necessity for a truly secret key, a random string of zeros and ones; the basic notion of quantum cryptography is to employ single photon transmissions (or the closest attainable approximation to these) to distribute the random key material, while removing the threat of an undetected eavesdropper. Now, nearly twenty years since the seminal quantum cryptography paper by Bennett and Brassard (Bennett C H and Brassard G 1984 Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing (Bangalore) (New York: IEEE) pp 175-9), we take a look at several state-of-the-art implementations, and glimpse how future quantum cryptosystems might look. We start with papers from three of the world's leading experimental quantum cryptography efforts: Stucki et al and Bethune and Risk describe working systems for quantum key distribution (QKD) over telecommunications fibres (at 1550 nanometres and 1300 nanometres, respectively). The former's achievement of quantum key exchange over 67 kilometres of optical fibre is a world record, as is the experimental demonstration by Hughes et al of daylight free-space QKD over a 10 km atmospheric range. Next, Lütkenhaus and Jahma explore the possible vulnerabilities of such systems (which employ attenuated laser pulses instead of actual single photon states) to conceivable future eavesdropping technologies. Enzer et al have implemented a totally new protocol, using polarization-entangled photons, which in some circumstances can tolerate higher error rates than the traditional one of Bennett and Brassard; moreover, the use of entanglement provides a means of `automatic source verification'. Finally, looking to the future, Elliott gives a provocative view of how these technologies may be merged into network operation, and Shapiro describes a method to combine a novel source of entangled photons with a means to transfer the photons' quantum state to trapped-atom quantum memories. If realized, these systems could presage the world's first quantum network. Focus on Quantum Cryptography Contents Quantum key distribution over 67 km with a plug&play system D Stucki, N Gisin, O Guinnard, G Ribordy and H Zbinden Autocompensating quantum cryptography Donald S Bethune and William P Risk Practical free-space quantum key distribution over 10 km in daylight and at night Richard J Hughes, Jane E Nordholt, Derek Derkacs and Charles G Peterson Quantum key distribution with realistic states: photon-number statistics in the photon-number splitting attack Norbert Lütkenhaus and Mika Jahma Entangled-photon six-state quantum cryptography Daphna G Enzer, Phillip G Hadley, Richard J Hughes, Charles G Peterson and Paul G Kwiat Building the quantum network Chip Elliott Architectures for long-distance quantum teleportation Jeffrey H Shapiro Ground to satellite secure key exchange using quantum cryptography J G Rarity, P R Tapster, P M Gorman and P Knight Method for decoupling error correction from privacy amplification Hoi-Kwong Lo Paul G Kwiat University of Illinois at Urbana-Champaign, USA