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/0212162 · Physical Review Letters

Unconditionally Secure Key Distribution Based on Two Nonorthogonal States

Kiyoshi Tamaki, Masato Koashi, Nobuyuki Imoto

Published Apr 24, 2003• 162 citations
arXivHTMLPDF

Abstract

We prove the unconditional security of the Bennett 1992 protocol, by using a reduction to an entanglement distillation protocol initiated by a local filtering process. The bit errors and the phase errors are correlated after the filtering, and we can bound the amount of phase errors from the observed bit errors by an estimation method involving nonorthogonal measurements. The angle between the two states shows a trade-off between accuracy of the estimation and robustness to noises.

DOI
10.1103/physrevlett.90.167904

Related papers

Security analysis of the Bennett 1992 quantum key-distribution protocol over a realistic channel

潔 玉木, キヨシ タマキ

In this thesis, we analyze the security of the Bennett 1992 quantum key-distribution protocol (B92 protocol) over a realistic channel assuming that bit values are encoded in single photon polarization states. First, we study the security of the B92 protocol against individual attack. In the individual attack, eavesdropper (Eve) interacts a qubit emitted by the sender (Alice) with her probe system followed by a measurement on each probe. To make our analysis simple, we propose a modified B92 protocol. Using this protocol, Alice and the receiver (Bob) can estimate Eve's information gain as a function of a few parameters that reflect the imperfections of devices or Eve's disturbance. We find a counter-intuitive behavior of Eve's maximum information gain, i.e., it decreases as the amount of disturbances increases. We also estimate the secret key gain that is the net growth of the secret key per one pulse. We show the region where the modified B92 protocol over a realistic channel is secure against individual attack. Next, we study the unconditional security of the B92 protocol, which is the security against any attack. To prove the security, we first propose a protocol that is unconditionally secure and can be reduced to the B92 protocol. This protocol employs the entanglement distillation protocol (EDP) based on a filtering operation and the Calderbank-Shor-Steane (CSS) quantum error correcting codes. The bit errors and the phase errors, which have to be estimated for the EDP based on the CSS codes, are correlated after the filtering operation, and we can bound the amount of phase errors from the observed bit errors by an estimation method involving nonorthogonal measurements. The angle between the two states shows a trade-off between accuracy of the estimation and robustness to noises. We show a way to run the unconditionally secure B92.

•Mar 24, 2004•0 citations

Robust unconditionally secure quantum key distribution with two nonorthogonal and uninformative states

Marco Lucamarini, Giovanni Di Giuseppe, Kiyoshi Tamaki

We present an unconventional form of decoy-state technique to make the single-photon Bennett 1992 protocol robust against losses and noise of a communication channel. Two uninformative states are prepared by the transmitter in order to prevent the unambiguous state discrimination attack and improve the phase-error rate estimation. The presented method does not require strong reference pulses, additional electronics, or extra detectors for its implementation.

arXiv:0907.0493•Physical Review A•Sep 23, 2009•27 citations

Unconditional security of coherent-state-based differential phase shift quantum key distribution protocol with block-wise phase randomization

Kiyoshi Tamaki, Masato Koashi, Go Kato

We prove the unconditional security of coherent-state-based differential phase shift quantum key distribution protocol (DPSQKD) with block-wise phase randomization. Our proof is based on the conversion of DPSQKD to an equivalent entanglement-distillation protocol where the estimated phase error rate determines the amount of the privacy amplification. The generated final key has a contribution from events where the sender emits two or more photons, indicating the robustness of DPSQKD against photon-number-splitting attacks.

arXiv:1208.1995•Aug 9, 2012•8 citations

Unconditional Security of a Three State Quantum Key Distribution Protocol

Jean-Christian Boileau, Kiyoshi Tamaki, Jamie Batuwantudawe +2 more

Quantum key distribution (QKD) protocols are cryptographic techniques with security based only on the laws of quantum mechanics. Two prominent QKD schemes are the Bennett-Brassard 1984 and Bennett 1992 protocols that use four and two quantum states, respectively. In 2000, Phoenix et al. proposed a new family of three-state protocols that offers advantages over the previous schemes. Until now, an error rate threshold for security of the symmetric trine spherical code QKD protocol has been shown only for the trivial intercept-resend eavesdropping strategy. In this Letter, we prove the unconditional security of the trine spherical code QKD protocol, demonstrating its security up to a bit error rate of 9.81%. We also discuss how this proof applies to a version of the trine spherical code QKD protocol where the error rate is evaluated from the number of inconclusive events.

arXiv:quant-ph/0408085•Physical Review Letters•Jan 31, 2005•84 citations

Quantum Key Distribution Based on Private States: Unconditional Security Over Untrusted Channels With Zero Quantum Capacity

Karol Horodecki, Michał Horodecki, Paweł Horodecki +2 more

In this paper, we prove unconditional security for a quantum key distribution (QKD) protocol based on distilling pbits (twisted ebits) from an arbitrary untrusted state that is claimed to contain distillable key. Our main result is that we can verify security using only public communication-via parameter estimation of the given untrusted state. The technique applies even to bound-entangled states, thus extending QKD to the regime where the available quantum channel has zero quantum capacity. We also show how to convert our purification-based QKD schemes to prepare/measure schemes.

arXiv:quant-ph/0608195•IEEE Transactions on Information Theory•May 29, 2008•69 citations

Information-theoretic security proof for quantum-key-distribution protocols

Renato Renner, Nicolas Gisin, Barbara Kraus

We present a technique for proving the security of quantum-key-distribution (QKD) protocols. It is based on direct information-theoretic arguments and thus also applies if no equivalent entanglement purification scheme can be found. Using this technique, we investigate a general class of QKD protocols with one-way classical post-processing. We show that, in order to analyze the full security of these protocols, it suffices to consider collective attacks. Indeed, we give new lower and upper bounds on the secret-key rate which only involve entropies of two-qubit density operators and which are thus easy to compute. As an illustration of our results, we analyze the Bennett-Brassard 1984, the six-state, and the Bennett 1992 protocols with one-way error correction and privacy amplification. Surprisingly, the performance of these protocols is increased if one of the parties adds noise to the measurement data before the error correction. In particular, this additional noise makes the protocols more robust against noise in the quantum channel.

arXiv:quant-ph/0502064•Physical Review A•Jul 25, 2005•521 citations
We prove the unconditional security of the Bennett 1992 protocol, by using a reduction to an entanglement distillation protocol initiated by a local filtering process. The bit errors and the phase errors are correlated after the filtering, and we can bound the amount of phase errors from the observed bit errors by an estimation method involving nonorthogonal measurements. The angle between the two states shows a trade-off between accuracy of the estimation and robustness to noises.
In this thesis, we analyze the security of the Bennett 1992 quantum key-distribution protocol (B92 protocol) over a realistic channel assuming that bit values are encoded in single photon polarization states. First, we study the security of the B92 protocol against individual attack. In the individual attack, eavesdropper (Eve) interacts a qubit emitted by the sender (Alice) with her probe system followed by a measurement on each probe. To make our analysis simple, we propose a modified B92 protocol. Using this protocol, Alice and the receiver (Bob) can estimate Eve's information gain as a function of a few parameters that reflect the imperfections of devices or Eve's disturbance. We find a counter-intuitive behavior of Eve's maximum information gain, i.e., it decreases as the amount of disturbances increases. We also estimate the secret key gain that is the net growth of the secret key per one pulse. We show the region where the modified B92 protocol over a realistic channel is secure against individual attack. Next, we study the unconditional security of the B92 protocol, which is the security against any attack. To prove the security, we first propose a protocol that is unconditionally secure and can be reduced to the B92 protocol. This protocol employs the entanglement distillation protocol (EDP) based on a filtering operation and the Calderbank-Shor-Steane (CSS) quantum error correcting codes. The bit errors and the phase errors, which have to be estimated for the EDP based on the CSS codes, are correlated after the filtering operation, and we can bound the amount of phase errors from the observed bit errors by an estimation method involving nonorthogonal measurements. The angle between the two states shows a trade-off between accuracy of the estimation and robustness to noises. We show a way to run the unconditionally secure B92.
We prove the unconditional security of coherent-state-based differential phase shift quantum key distribution protocol (DPSQKD) with block-wise phase randomization. Our proof is based on the conversion of DPSQKD to an equivalent entanglement-distillation protocol where the estimated phase error rate determines the amount of the privacy amplification. The generated final key has a contribution from events where the sender emits two or more photons, indicating the robustness of DPSQKD against photon-number-splitting attacks.
Quantum key distribution (QKD) protocols are cryptographic techniques with security based only on the laws of quantum mechanics. Two prominent QKD schemes are the Bennett-Brassard 1984 and Bennett 1992 protocols that use four and two quantum states, respectively. In 2000, Phoenix et al. proposed a new family of three-state protocols that offers advantages over the previous schemes. Until now, an error rate threshold for security of the symmetric trine spherical code QKD protocol has been shown only for the trivial intercept-resend eavesdropping strategy. In this Letter, we prove the unconditional security of the trine spherical code QKD protocol, demonstrating its security up to a bit error rate of 9.81%. We also discuss how this proof applies to a version of the trine spherical code QKD protocol where the error rate is evaluated from the number of inconclusive events.
In this paper, we prove unconditional security for a quantum key distribution (QKD) protocol based on distilling pbits (twisted ebits) from an arbitrary untrusted state that is claimed to contain distillable key. Our main result is that we can verify security using only public communication-via parameter estimation of the given untrusted state. The technique applies even to bound-entangled states, thus extending QKD to the regime where the available quantum channel has zero quantum capacity. We also show how to convert our purification-based QKD schemes to prepare/measure schemes.
We present a technique for proving the security of quantum-key-distribution (QKD) protocols. It is based on direct information-theoretic arguments and thus also applies if no equivalent entanglement purification scheme can be found. Using this technique, we investigate a general class of QKD protocols with one-way classical post-processing. We show that, in order to analyze the full security of these protocols, it suffices to consider collective attacks. Indeed, we give new lower and upper bounds on the secret-key rate which only involve entropies of two-qubit density operators and which are thus easy to compute. As an illustration of our results, we analyze the Bennett-Brassard 1984, the six-state, and the Bennett 1992 protocols with one-way error correction and privacy amplification. Surprisingly, the performance of these protocols is increased if one of the parties adds noise to the measurement data before the error correction. In particular, this additional noise makes the protocols more robust against noise in the quantum channel.