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/9904091 · Journal of Physics A Mathematical and General

A simple proof of the unconditional security of quantum key distribution

Hoi‐Kwong Lo

Published Aug 24, 2001• 57 citations
arXivHTMLPDF

Abstract

Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtleties. Here, a conceptually simpler proof of security of quantum key distribution is presented. The new insight is the invariance of the error rate of a teleportation channel: we show that the error rate of a teleportation channel is independent of the signals being transmitted. This is because the non-trivial error patterns are permuted under teleportation. This new insight is combined with the recently proposed quantum-to-classical reduction theorem. Our result shows that assuming that Alice and Bob have fault-tolerant quantum computers, quantum key distribution can be made unconditionally secure over arbitrarily long distances even against the most general type of eavesdropping attacks and in the presence of all types of noises.

DOI
10.1088/0305-4470/34/35/321

Related papers

Quantum Computers Render Quantum Key Distribution Unconditionally Secure Over Arbitrarily Long Distance

Hoi‐Kwong Lo, H. F. Chau

Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most well-known application. This notoriously hard problem has eluded researchers for years and has become even more important after the recent surprising demonstration of the insecurity of many other quantum cryptographic schemes including quantum bit commitment. Here, we solve this long standing problem by showing that, given quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The novel technique we use is reduction from a quantum scheme to a classical scheme. The security in realistic noisy environments is then proven by using the recent theory of fault-tolerant quantum computation.

•Mar 3, 1998•6 citations

Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances

Hoi‐Kwong Lo, H. F. Chau

Quantum key distribution is widely thought to offer unconditional security in communication between two users. Unfortunately, a widely accepted proof of its security in the presence of source, device, and channel noises has been missing. This long-standing problem is solved here by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The proof is reduced from a noisy quantum scheme to a noiseless quantum scheme and then from a noiseless quantum scheme to a noiseless classical scheme, which can then be tackled by classical probability theory.

arXiv:quant-ph/9803006•Science•Mar 26, 1999•1,927 citations

Security of Quantum Key Distribution

Hoi-Kwong Lo, H. F. Chau

We construct a new quantum key distribution scheme and prove its security against the most general type of attacks and the most general type of noises allowed by quantum physics. The novel technique we use is reduction from a quantum scheme to a classical scheme. We first show that, rather surprisingly, the proof of security of our quantum key distribution in the error-free case can be reduced to that of a classical verification scheme. In other words, the quantum verification procedure employed by us has a classical interpretation. By proving the security of the classical scheme, the security of our quantum key distribution scheme in the error-free case follows immediately. The security against the most general types of noises (channel noises, storage errors and computational errors) is then proven by using fault-tolerant quantum computation.

•Mar 3, 1998•6 citations

A Generic Security Proof for Quantum Key Distribution

Matthias Christandl, Renato Renner, ARTUR K. EKERT

Quantum key distribution allows two parties, traditionally known as Alice and Bob, to establish a secure random cryptographic key if, firstly, they have access to a quantum communication channel, and secondly, they can exchange classical public messages which can be monitored but not altered by an eavesdropper, Eve. Quantum key distribution provides perfect security because, unlike its classical counterpart, it relies on the laws of physics rather than on ensuring that successful eavesdropping would require excessive computational effort. However, security proofs of quantum key distribution are not trivial and are usually restricted in their applicability to specific protocols. In contrast, we present a general and conceptually simple proof which can be applied to a number of different protocols. It relies on the fact that a cryptographic procedure called privacy amplification is equally secure when an adversary's memory for data storage is quantum rather than classical.

arXiv:quant-ph/0402131•Feb 18, 2004•112 citations

Análise de segurança de criptografia quântica baseada em teletransporte

Diogo Henrique Garcia Lima

We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun. 283, 184 (2010)], which is built using only orthogonal states encoding the classical bits that are teleported from Alice to Bob, is asymptotically secure against all types of individual and collective attacks. We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks. In other words, we show an unconditional secure quantum key distribution protocol that does not need non-orthogonal quantum states to encode the bits of the secret key sent from \nAlice to Bob. We also revisit the security proof of the BB84 protocol by exploring the non-uniqueness of the Schmidt decomposition of its entanglement-based representation. This allows us to arrive at a secure transmission of the key for a slightly greater quantum bit error rate (quantum communication channel’s noise) when compared to its standard security analysis. After that, we investigate how different types of the noise usually present in realistic implementations of the BB84 protocolo affect its operation.

•Feb 4, 2021•0 citations

Unconditional security proof of a deterministic quantum key distribution with a two-way quantum channel

Hua Lu, Chi‐Hang Fred Fung, Xiongfeng Ma +1 more

In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD protocol with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD protocol against general attacks.

arXiv:1111.0109•Physical Review A•Oct 31, 2011•71 citations
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtleties. Here, a conceptually simpler proof of security of quantum key distribution is presented. The new insight is the invariance of the error rate of a teleportation channel: we show that the error rate of a teleportation channel is independent of the signals being transmitted. This is because the non-trivial error patterns are permuted under teleportation. This new insight is combined with the recently proposed quantum-to-classical reduction theorem. Our result shows that assuming that Alice and Bob have fault-tolerant quantum computers, quantum key distribution can be made unconditionally secure over arbitrarily long distances even against the most general type of eavesdropping attacks and in the presence of all types of noises.
Quantum cryptography has long been claimed to be useful for achieving many tasks that are impossible from the perspective of conventional cryptography. Arguably, the most important problem in quantum cryptography has been a rigorous proof of the security of quantum key distribution, the most well-known application. This notoriously hard problem has eluded researchers for years and has become even more important after the recent surprising demonstration of the insecurity of many other quantum cryptographic schemes including quantum bit commitment. Here, we solve this long standing problem by showing that, given quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The novel technique we use is reduction from a quantum scheme to a classical scheme. The security in realistic noisy environments is then proven by using the recent theory of fault-tolerant quantum computation.
Quantum key distribution is widely thought to offer unconditional security in communication between two users. Unfortunately, a widely accepted proof of its security in the presence of source, device, and channel noises has been missing. This long-standing problem is solved here by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The proof is reduced from a noisy quantum scheme to a noiseless quantum scheme and then from a noiseless quantum scheme to a noiseless classical scheme, which can then be tackled by classical probability theory.
We construct a new quantum key distribution scheme and prove its security against the most general type of attacks and the most general type of noises allowed by quantum physics. The novel technique we use is reduction from a quantum scheme to a classical scheme. We first show that, rather surprisingly, the proof of security of our quantum key distribution in the error-free case can be reduced to that of a classical verification scheme. In other words, the quantum verification procedure employed by us has a classical interpretation. By proving the security of the classical scheme, the security of our quantum key distribution scheme in the error-free case follows immediately. The security against the most general types of noises (channel noises, storage errors and computational errors) is then proven by using fault-tolerant quantum computation.
Quantum key distribution allows two parties, traditionally known as Alice and Bob, to establish a secure random cryptographic key if, firstly, they have access to a quantum communication channel, and secondly, they can exchange classical public messages which can be monitored but not altered by an eavesdropper, Eve. Quantum key distribution provides perfect security because, unlike its classical counterpart, it relies on the laws of physics rather than on ensuring that successful eavesdropping would require excessive computational effort. However, security proofs of quantum key distribution are not trivial and are usually restricted in their applicability to specific protocols. In contrast, we present a general and conceptually simple proof which can be applied to a number of different protocols. It relies on the fact that a cryptographic procedure called privacy amplification is equally secure when an adversary's memory for data storage is quantum rather than classical.
We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun. 283, 184 (2010)], which is built using only orthogonal states encoding the classical bits that are teleported from Alice to Bob, is asymptotically secure against all types of individual and collective attacks. We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks. In other words, we show an unconditional secure quantum key distribution protocol that does not need non-orthogonal quantum states to encode the bits of the secret key sent from \nAlice to Bob. We also revisit the security proof of the BB84 protocol by exploring the non-uniqueness of the Schmidt decomposition of its entanglement-based representation. This allows us to arrive at a secure transmission of the key for a slightly greater quantum bit error rate (quantum communication channel’s noise) when compared to its standard security analysis. After that, we investigate how different types of the noise usually present in realistic implementations of the BB84 protocolo affect its operation.
In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD protocol with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD protocol against general attacks.