Unconditional Security of a Three State Quantum Key Distribution Protocol

Boileau, Jean-Christian; Tamaki, Kiyoshi; Batuwantudawe, J.; Laflamme, Raymond; Renes, Joseph M.

doi:10.1103/physrevlett.94.040503

Cited by 90 publications

(99 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(14) holds true in the asymptotic limit in which the block size for each photon number ν is large. As we show in Appendix B, with a more detailed analysis using Azuma's inequality [11,12], we can show that it holds true if the total block size is large.…”

Section: The Phase Error Estimationmentioning

confidence: 91%

Unconditional security of the Bennett 1992 quantum-key-distribution scheme with a strong reference pulse

et al. 2009

View full text Add to dashboard Cite

We prove the unconditional security of the original Bennett 1992 protocol with strong reference pulse. We show that we may place a projection onto suitably defined qubit spaces before the receiver, which makes the analysis as simple as qubit-based protocols. Unlike the single-photon-based qubits, the qubits identified in this scheme are almost surely detected by the receiver even after a lossy channel. This leads to the key generation rate that is proportional to the channel transmission rate for proper choices of experimental parameters.

show abstract

Section: The Phase Error Estimationmentioning

confidence: 91%

Unconditional security of the Bennett 1992 quantum-key-distribution scheme with a strong reference pulse

et al. 2009

View full text Add to dashboard Cite

show abstract

“…However, our results also hold against coherent attacks by just applying either the quantum De Finetti theorem [23] or Azuma's inequality [24][25][26] (see Appendix A for details). Moreover, for simplicity, we consider the asymptotic scenario where Alice sends Bob an infinite number of signals.…”

mentioning

confidence: 87%

“…2 in the l th run conditioned on all previous measurement outcomes, we can determine the actual occurrence number of the corresponding events (see Refs. [25,26] for a proof of this statement).…”

mentioning

confidence: 99%

See 1 more Smart Citation

Loss-tolerant quantum cryptography with imperfect sources

Tamaki

Curty

Kato³

et al. 2014

Phys. Rev. A

183

287

View full text Add to dashboard Cite

In principle, quantum key distribution (QKD) offers unconditional security based on the laws of physics. In practice, flaws in the state preparation undermine the security of QKD systems, as standard theoretical approaches to deal with state preparation flaws are not loss-tolerant. An eavesdropper can enhance and exploit such imperfections through quantum channel loss, thus dramatically lowering the key generation rate. Crucially, the security analyses of most existing QKD experiments are rather unrealistic as they typically neglect this effect. Here, we propose a novel and general approach that makes QKD loss-tolerant to state preparation flaws. Importantly, it suggests that the state preparation process in QKD can be significantly less precise than initially thought. Our method can widely apply to other quantum cryptographic protocols.PACS numbers: 03.67.Dd, 03.67.-a Introduction.-Quantum key distribution (QKD) [1] allows two distant parties, Alice and Bob, to distribute a secret key, which is essential to achieve provable secure communications [2]. The field of QKD has progressed very rapidly over the last years, and it now offers practical systems that can operate in realistic environments [3,4].Crucially, QKD provides unconditional security based on the laws of physics, i.e., despite the computational power of the eavesdropper, Eve. Indeed, the security of QKD has been promptly demonstrated for different scenarios [5][6][7][8][9][10][11][12]. Importantly, Gottesman, Lo, Lütkenhaus and Preskill [13] (henceforth referred to as GLLP) proved the security of QKD when Alice's and Bob's devices are flawed, as is the case in practical implementations. Unfortunately, however, GLLP has a severe limitation, namely, it is not loss-tolerant; it assumes the worst case scenario where Eve can enhance flaws in the state preparation by exploiting channel loss. As a result, the key generation rate and achievable distance of QKD are dramatically reduced [14]. Notice that most existing QKD experiments simply ignore state preparation imperfections in their key rate formula, which renders their results unrealistic and not really secure.In this Letter, we show that GLLP's worst case assumption is far too conservative, i.e., in sharp contrast to GLLP, we present a security proof for QKD that is loss-tolerant. Indeed, for the case of modulation errors, an important flaw in real-life QKD systems, we show that Eve cannot exploit channel loss to enhance such imperfections. The intuition here is rather simple: in this type of state preparation flaws the signals sent out by Alice are still qubits, i.e., there is no side-channel for Eve to exploit

show abstract

“…If error rate exceeds beyond acceptable error threshold after the legitimate parties crosschecking afraction of their sifted keys, eavesdropping occurred and the established sifted key isdiscarded without losing any valuable information [13 -18]. There are a lot of protocols have been devised in QKD research such as BB84, Ekert 1991 (E91) [25], Bennett 1992 (B92) [26], Bennett-Brassard-Mermin 1992 (BBM92) [27], six-state [28], three-state [29] and Scarani-Acín-Ribordy-Gisin 2004 (SARG04) [30] protocols. The B92, six-state, three-state and SARG04 protocols are variations of BB84 protocol based on prepare-and-measure strategy, whereas E91 and BBM92 protocols are variations of BB84 protocol based on quantum entanglement means.…”

Section: Quantum Key Distribution (Qkd)mentioning

confidence: 99%

A Novel Error Correction Scheme In Quantum Key Distribution (Qkd) Protocol

Lee

Mokhtar

2017

MJCS

View full text Add to dashboard Cite

Ideally, in any quantum key distribution (QKD) Keywords: Hamming code, error correction, QKD, reconciliation protocol. INTRODUCTIONConfidentiality, integrity, authentication and non-repudiation are four significant criteria specified to ensure secrecy in communication between legitimate parties nowadays [1 -6]. In order to achieve these requirements, several measures based on cryptography have long since been practiced. Previously confidentiality is secured via encryption by transforming ordinary message into scrambled text prior to dissemination, thus concealing information in the message. Meanwhile, one-way cryptographic hash function was exploited to corroborate the correctness of a received message without undue amendment in transit, thus contributing towards the verification of message integrity. Surpassing the hash function, the utilization of message authentication code allows authentication to justify user identity besides safeguarding message's integrity. Lastly, digital signature is utilized to address nonrepudiation, deterring refutability of forgeable actions like financial transaction consummated via electronic payment [1].The Advanced Encryption Standard (AES) [7,8] is a symmetric-key cryptography which has been adopted worldwide today to protect classified information. An algorithm described by Ronald Rivest, Adi Shamir and Leonard Adleman or commonly known as RSA [9] is the pioneer in brand-new asymmetric-key cryptography, used mainly to consolidate key-agreement protocol. Together with lengthy secret key, the former utilizes substitutionpermutation network which creates confusion and diffusion for secure cryptography, whereas the later makes use of infeasibility to factor large numbers in retrieving key via classical computer for the same purpose [10].

show abstract

Unconditional Security of a Three State Quantum Key Distribution Protocol

Cited by 90 publications

References 16 publications

Unconditional security of the Bennett 1992 quantum-key-distribution scheme with a strong reference pulse

Unconditional security of the Bennett 1992 quantum-key-distribution scheme with a strong reference pulse

Loss-tolerant quantum cryptography with imperfect sources

A Novel Error Correction Scheme In Quantum Key Distribution (Qkd) Protocol

Contact Info

Product

Resources

About