Decoy State Quantum Key Distribution

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

There has been much interest in quantum key distribution. Experimentally, quantum key distribution over 150 km of commercial Telecom fibers has been successfully performed. The crucial issue in quantum key distribution is its security. Unfortunately, all recent experiments are, in principle, insecure due to real-life imperfections. Here, we propose a method that can for the first time make most of those experiments secure by using essentially the same hardware. Our method is to use decoy states to detect eavesdropping attacks. As a consequence, we have the best of both worlds--enjoying unconditional security guaranteed by the fundamental laws of physics and yet dramatically surpassing even some of the best experimental performances reported in the literature.

Related collections

Most cited references 11

Record: found
Abstract: found
Article: not found

Simple Proof of Security of the BB84 Quantum Key Distribution Protocol

Peter W. Shor, John Preskill (2000)

We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. We first give a key distribution protocol based on entanglement purification, which can be proven secure using methods from Lo and Chau's proof of security for a similar protocol. We then show that the security of this protocol implies the security of BB84. The entanglement purification based protocol uses Calderbank-Shor-Steane codes, and properties of these codes are used to remove the use of quantum computation from the Lo-Chau protocol.

0 comments Cited 309 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: not found

Beating the photon-number-splitting attack in practical quantum cryptography.

Xiang-Bin Wang (2005)

We propose an efficient method to verify the upper bound of the fraction of counts caused by multiphoton pulses in practical quantum key distribution using weak coherent light, given whatever type of Eve's action. The protocol simply uses two coherent states for the signal pulses and vacuum for the decoy pulse. Our verified upper bound is sufficiently tight for quantum key distribution with a very lossy channel, in both the asymptotic and nonasymptotic case. So far our protocol is the only decoy-state protocol that works efficiently for currently existing setups.

0 comments Cited 248 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: not found

Quantum key distribution with high loss: toward global secure communication.

Won-Young Hwang (2003)

We propose a decoy-pulse method to overcome the photon-number-splitting attack for Bennett-Brassard 1984 quantum key distribution protocol in the presence of high loss: A legitimate user intentionally and randomly replaces signal pulses by multiphoton pulses (decoy pulses). Then they check the loss of the decoy pulses. If the loss of the decoy pulses is abnormally less than that of signal pulses, the whole protocol is aborted. Otherwise, to continue the protocol, they estimate the loss of signal multiphoton pulses based on that of decoy pulses. This estimation can be done with an assumption that the two losses have similar values. We justify that assumption.