We report here a complete experimental realization of one-way decoy-pulse quantum key distribution, demonstrating an unconditionally secure key rate of 5.51 kbps for a 25.3 km fibre length. This is two orders of magnitudes higher than the value that can be obtained with a non-decoy system. We introduce also a simple test for detecting the photon number splitting attack and highlight that it is essential for the security of the technique to fully characterize the source and detectors used.
We present a general theorem for the efficient verification of the lower bound of single-photon transmittance. We show how to do decoy-state quantum key distribution efficiently with large random errors in the intensity control. In our protocol, the linear terms of fluctuation disappear and only the quadratic terms take effect. We then show the unconditional security of decoy-state method with whatever error pattern in intensities of decoy pulses and signal pulses provided that the intensity of each decoy pulse is less than $μ$ and the intensity of each signal pulse is larger than $μ'$.
High-dimensional quantum key distribution (HD-QKD) allows two parties to generate multiple secure bits of information per detected photon. In this work, we show that decoy state protocols can be practically implemented for HD-QKD using only one or two decoy states. HD-QKD with two decoy states, under realistic experimental constraints, can generate multiple secure bits per coincidence at distances over 200 km and at rates similar to those achieved by a protocol with infinite decoy states. Furthermore, HD-QKD with only one decoy state is practical at short distances, where it is almost as secur…
The method of decoy-state quantum key distribution (QKD) requests different intensities of light pulses. Existing theory has assumed exact control of intensities. Here we propose a simple protocol which is secure and efficient even there are errors in intensity control. In our protocol, decoy pulses and signal pulses are generated from the same father pulses with a two-value attenuation. Given the upper bound of fluctuation of the father pulses, our protocol is secure provided that the two-value attenuation is done exactly. We propose to use unbalanced beam-splitters for a stable attenuation. …
We report the first gigahertz clocked decoy-protocol quantum key distribution (QKD). Record key rates have been achieved thanks to the use of self-differencing InGaAs avalanche photodiodes designed specifically for high speed single photon detection. The system is characterized with a secure key rate of 1.02 Mbit/s for a fiber distance of 20 km and 10.1 kbit/s for 100 km. As the present advance relies upon compact non-cryogenic detectors, it opens the door towards practical and low cost QKD systems to secure broadband communication in future.
To increase dramatically the distance and the secure key generation rate of quantum key distribution (QKD), the idea of quantum decoys--signals of different intensities--has recently been proposed. Here, we present the first experimental implementation of decoy state QKD. By making simple modifications to a commercial quantum key distribution system, we show that a secure key generation rate of 165bit/s, which is 1/4 of the theoretical limit, can be obtained over 15km of a Telecom fiber. We also show that with the same experimental parameters, not even a single bit of secure key can be extract…
A quantum secure direct communication network scheme is proposed with quantum superdense coding and decoy photons. The servers on a passive optical network prepare and measure the quantum signal, i.e., a sequence of the $d$-dimensional Bell states. After confirming the security of the photons received from the receiver, the sender codes his secret message on them directly. For preventing a dishonest server from eavesdropping, some decoy photons prepared by measuring one photon in the Bell states are used to replace some original photons. One of the users on the network can communicate any othe…
Quantum key distribution (QKD) is a technology that allows two users to exchange keys securely. The decoy state technique enhances the technology, ensuring keys can be shared at high bit rates over long distances with information theoretic security. However, imperfections in the implementation, known as side-channels, threaten the perfect security of practical QKD protocols. Intensity modulators are required for high-rate decoy state QKD systems, although these are unstable and can display a side channel where the intensity of a pulse is dependent on the previous pulse. Here we demonstrate the…
We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-…
We propose a decoy-state 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 multi-photon pulses (decoy-states). Then they check the loss of the decoy-states. If the loss of the decoy-states is abnormally less than that of signal pulses, the whole protocol is aborted. Otherwise, to continue the protocol, they estimate loss of signal multi-photon pulses based on that of decoy-states. This estimation can be done with an assumption that…
This article describes a quantum bit commitment protocol, QBC1, based on entanglement destruction via forced measurements and proves its unconditional security.
In secure quantum communication protocols, a set of single qubits prepared using 2 or more mutually unbiased bases or a set of $n$-qubit ($n\geq2$) entangled states of a particular form are usually used to form a verification string which is subsequently used to detect traces of eavesdropping. The qubits that form a verification string are referred to as decoy qubits, and there exists a large set of different quantum states that can be used as decoy qubits. In the absence of noise, any choice of decoy qubits provides equivalent security. In this paper, we examine such equivalence for noisy env…
An unconditionally secure quantum cion tossing protocol for two remote participants via entangled swapping is presented. The security of this protocol is guaranteed by the nonlocal property of quantum entanglement and the classical complexity.
It is generally believed that unconditionally secure quantum bit commitment (QBC) is proven impossible by a "no-go theorem". We point out that the theorem only establishes the existence of a cheating unitary transformation in any QBC scheme secure against the receiver, but this fact alone is not sufficient to rule out unconditionally secure QBC as a matter of principle, because there exists no proof that the cheating unitary transformation must be known to the cheater in all possible cases. In this work, we show how to circumvent the "no-go theorem" and prove that unconditionally secure QBC is…
We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that unconditionally-secure and reusable public-key authentication is possible in principle with (pure-state) public keys.
We introduce a novel 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.
We demonstrate a weak pulse quantum key distribution system using the BB84 protocol which is secure against all individual attacks, including photon number splitting. By carefully controlling the weak pulse intensity we demonstrate the maximum secure bit rate as a function of the fibre length. Unconditionally secure keys can be formed for standard telecom fibres exceeding 50 km in length.
The ``impossibility proof'' on unconditionally secure quantum bit commitment is examined. It is shown that the possibility of juxtaposing quantum and classical randomness has not been properly taken into account. A specific protocol that beats entanglement cheating with entanglement is proven to be unconditionally secure.
We present a method without decoy state to estimate faithfully and efficiently the yield and quantum bit error rate of single photon pulse for BB84 protocol. The numerical calculations show that key generation rate and maximal secure communication distance of our method are better than results of the decoy state method. As we know, it is the first time we present this method and the idea is very novel. Furthermore, our method can overcome the drawbacks of decoy state method. In our method, the maximal secure distance is insensitive to the deviation of dark count rate from exact value.
The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed. Many possibilities for obtaining a secure bit commitment protocol are indicated, purely on the basis of two-way quantum communications, which are not covered by the impossibility proof formulation. They are classified under six new types of protocols, with security proofs for specific examples on four types. Reasons for some previously failed attempts at obtaining secure protocols are also indicated.
A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocol that does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.
The existing theory of decoy-state quantum cryptography assumes the exact control of each states from Alice's source. Such exact control is impossible in practice. We develop the theory of decoy-state method so that it is unconditionally secure even there are state errors of sources, if the range of a few parameters in the states are known. This theory simplifies the practical implementation of the decoy-state quantum key distribution because the unconditional security can be achieved with a slightly shortened final key, even though the small errors of pulses are not corrected.
Secure key rate of decoy-state quantum key distribution protocols has been improved with biased basis choice, however, the security standards and parameters of current protocols are different. As a result, we cannot give an accurate key rate comparison between different kinds of protocols. Taking the schemes based on different formula of secure key rate as examples, we give a fair comparison between typical protocols under universal composable security standard. Through analyzing the relationship of security parameters in post-processing stage and final secure key, we achieve the unified quant…
This paper has been withdrawn by the authors,because the proposed protocol is still coverd by the no-go theorem of Mayers, Lo and Chau. We thank H-K. Lo and HF Chau for helpful correspondences.
This article describes a quantum bit commitment protocol, QBC3, based on entanglement destruction via forced measurements and proves its unconditional security. Some comments on the current status of the field are also made.
Spacetime-constrained oblivious transfer (SCOT) extends the fundamental primitive of oblivious transfer to Minkowski space. SCOT and location oblivious data transfer (LODT) are the only known cryptographic tasks with classical inputs and outputs for which unconditional security needs both quantum theory and relativity. We give an unconditionally secure SCOT protocol that, contrasting previous SCOT and LODT protocols, is practical to implement with current technology, where distant agents need only communicate classical information, while quantum communication occurs at a single location. We al…
Measurement-device-independent quantum key distribution (MDI-QKD) is immune to all the detection attacks; thus when it is combined with the decoy-state method, the final key is unconditionally secure, even if a practical weak coherent source is used by Alice and Bob. However, until now, the analysis of decoy-state MDI-QKD with a weak coherent source is incomplete. In this paper, we derive, with only vacuum+weak decoy state, some tight formulas to estimate the lower bound of yield and the upper bound of error rate for the fraction of signals in which both Alice and Bob send a single-photon puls…
Without actively aligning the reference frames, the reference-frame-independent quantum key distribution (RFI-QKD) can generate secure keys even when the reference frames drift slowly. Here, we propose a new scheme on the decoy-state RFI-QKD, where the basis assignments of two legitimate parties are biased, reducing the fraction of mismatched-basis data. When accounting for statistical fluctuations under different misalignments of reference frames, we investigate the performance of biased decoy-state RFI-QKD with full parameter optimization. We also make a clear comparison between the new sche…
Over decades quantum cryptography has been intensively studied for unconditionally secured data transmission in a quantum regime. Due to the quantum loopholes caused by imperfect single photon detectors and/or lossy quantum channels, however, the quantum cryptography is practically inefficient and even vulnerable to eavesdropping. Here, a method of unconditionally secured key distribution potentially compatible with current fiber-optic communications networks is proposed in a classical regime for high-speed optical backbone networks. The unconditional security is due to the quantum superpositi…
The use of decoy states in quantum key distribution (QKD) has provided a method for substantially increasing the secret key rate and distance that can be covered by QKD protocols with practical signals. The security analysis of these schemes, however, leaves open the possibility that the development of better proof techniques, or better classical post-processing methods, might further improve their performance in realistic scenarios. In this paper, we derive upper bounds on the secure key rate for decoy state QKD. These bounds are based basically only on the classical correlations established …
The existing decoy-state quantum key distribution (QKD) beating photon-number-splitting (PNS) attack provides a more accurate method to estimate secure key rate, while it still considers that only single-photon pulses can generate secure keys in any case. However, multiphoton pulses can also generate secure keys if we can confirm that there is no attack. In this paper, under the null hypothesis of no PNS attack, we first determine whether there is an attack or not by retrieving the missing information of the existing decoy-state protocols, extract a Cauchy distribution statistic, and further p…
The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol, which has been proved secure against general attacks in the finite-key regime. Thereinto, statistical fluctuation analysis methods are very important in dealing with finite-key effects, which directly affect secret key rate, secure transmission distance and even the most important security. There are two tasks of statistical fluctuation in decoy-state BB84 QKD. One is the deviation between expected value and observed value for a given expected value or observed value. The other is…
By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally secure protocol. The well-known ``impossibility proof'' does not cover such protocols due to its different commitment and opening prescriptions, which necessitate actual quantum measurements among different possible systems that cannot be entangled as a consequence.
We demonstrate the decoy-state quantum key distribution (QKD) with one-way quantum communication in polarization space over 102km. Further, we simplify the experimental setup and use only one detector to implement the one-way decoy-state QKD over 75km, with the advantage to overcome the security loopholes due to the efficiency mismatch of detectors. Our experimental implementation can really offer the unconditionally secure final keys. We use 3 different intensities of 0, 0.2 and 0.6 for the pulses of source in our experiment. In order to eliminate the influences of polarization mode dispersio…
We propose an unconditionally secure quantum key distribution (QKD) protocol, which uses a relatively strong signal pulse. While our protocol shares similar security bases as the Bennett 1992 protocol with a strong reference pulse (B92), our scheme uses a smaller number of detectors and it is robust against Rayleigh scattering in an optical fibre. We derive a lower bound of secret key generation rate of our protocol and show that our protocol can cover relatively long distances, assuming precise phase modulations and stable interferometers.
We present relevant bounds for the case of weak+vacuum decoy state and one decoy state for a two way four states Quantum Key Distribution (QKD) protocol. The numerical simulation result was significant given that an improvement in maximum secure distance of nearly double is achieved.
Based on the detection loophole-free photon key distribution (PKD) compatible with classical optical systems, an optical key distribution (OKD) protocol is presented for unconditionally secured cryptography in fiber-optic communications networks using addressable continuous phase basis, where each communication channel is composed of paired transmission lines. The unconditional security in OKD lies in quantum superposition between the paired lines of each channel. The continuous phase basis in OKD can be applied for one-time-pad optical cryptography in networks, whose network address capacity …
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. In this paper, the scope of this general impossibility proof is extended and analyzed, and gaps are found. Three specific protocols are described for which the entanglement cheating as given…
Long-distance quantum communication requires quantum repeaters to overcome photon loss in optical fibers. Here we demonstrate a repeater node with two memory atoms in an optical cavity. Both atoms are individually and repeatedly entangled with photons that are distributed until each communication partner has independently received one of them. An atomic Bell-state measurement followed by classical communication serves to establish a key. We demonstrate scaling advantage of the key rate, increase the effective attenuation length by a factor of two, and beat the error-rate threshold of 11\% for …
Using a neutron double-slit setup, we construct a quantum bit commitment scheme in which time development of quantum states plays an essential role. Our scheme evades the widely accepted no-go theorem by the fact that it is neither possible to stop the time evolution of spreading wave packets, nor is it possible to evolve them backward in time. Moreover, for unstable particles such as neutrons, one cannot delay detecting their positions indefinitely, or they would disintegrate spontaneously and escape detection. We find that using non-stationary states instead of stationary ones, unconditional…
We report on the first demonstration of a two way Quantum Key Distribution protocol with decoy state. The experiment was conducted over free space medium and exhibits a significant increase in the maximum secure distance.
Compared with two-level quantum key distribution (QKD), highdimensional QKD enable two distant parties to share a secret key at a higher rate. We provide a finite-key security analysis for the recently proposed practical highdimensional decoy-state QKD protocol based on time-energy entanglement. We employ two methods to estimate the statistical fluctuation of the postselection probability and give a tighter bound on the secure-key capacity. By numerical evaluation, we show the finite-key effect on the secure-key capacity in different conditions. Moreover, our approach could be used to optimize…
We propose a new classical bit commitment protocol using the relativistic constraint that signals cannot travel faster than the speed of light $c$. This protocol is unconditionally secure against both classical or quantum attacks. The sender (Alice) and the receiver (Bob) each controls two secure stations separated by a large distance $d$, and they communicate by exchanging classical information only. Alice commits by sending from her stations two causally independent encrypted messages to the neighboring Bob's stations, after that the protocol is out of her control and she plays no role in th…
We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M \geq 2$ parties and to $N \geq 2$ outcomes for any chosen outcome biases, and show them unconditionally secure. Our results prove that the most general random secure multi-party computation, where all parties receive the output and there is no secret input by any party, can be implemented with unconditional security. Our protocols extend Kent's [A. Kent, Phys. Rev. Lett. 83, 5382 (1999)] two-party unbiased coin flipping protocol, do not require any quantum communication, are practical to implem…
Secure quantum key distribution can be achieved with an imperfect single-photon source through implementing the decoy-state method. However, security of all those theoretical results of decoy-state method based on the original framework raised by Hwang needs monitoring the source state very carefully, because the elementary proposition that the counting rates of the same state from different sources are equal does not hold in general when the source is unstable. Source intensity monitoring greatly decreases the system efficiency. Here without using Hwang's proposition for stable source, we pre…
Quantum key distribution (QKD) has the potential for widespread real-world applications. To date no secure long-distance experiment has demonstrated the truly practical operation needed to move QKD from the laboratory to the real world due largely to limitations in synchronization and poor detector performance. Here we report results obtained using a fully automated, robust QKD system based on the Bennett Brassard 1984 protocol (BB84) with low-noise superconducting nanowire single-photon detectors (SNSPDs) and decoy levels. Secret key is produced with unconditional security over a record 144.3…
Quantum Key Distribution (QKD) is an innovative quantum communications protocol which exploits the laws of quantum mechanics to generate unconditionally secure cryptographic keying material between two geographically separated parties. The unique nature of QKD shows promise for high-security applications such as those found in banking, government, and military environments. However, QKD systems contain implementation non-idealities which can negatively impact their performance and security.In particular, QKD systems often employ the decoy state protocol to improve system throughput and mitigat…
Unconditionally secure quantum bit commitment (QBC) was considered impossible. But the no-go proofs are based on the Hughston-Jozsa-Wootters (HJW) theorem (a.k.a. the Uhlmann theorem). Recently it was found that in high-dimensional systems, there exist some states which can display a chaos effect in quantum steering, so that the attack strategy based on the HJW theorem has to require the capability of discriminating quantum states with very subtle difference, to the extent that is not allowed by the uncertainty principle. With the help of this finding, here we propose a simple QBC protocol whi…
A new relativistic quantum protocol is proposed allowing to implement the bit commitment scheme. The protocol is based on the idea that in the relativistic case the field propagation to the region of space accessible to measurement requires, contrary to the non-relativistic case, a finite non-zero time which depends on the structure of the particular state of the field. In principle, the secret bit can be stored for arbitrarily long time with the probability arbitrarily close to unit.
In this paper, we prove that the unconditionally secure key can be surprisingly extracted from {\it multi}-photon emission part in the photon polarization-based QKD. One example is shown by explicitly proving that one can indeed generate an unconditionally secure key from Alice's two-photon emission part in ``Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulses implementations'' proposed by V. Scarani {\it et al.,} in Phys. Rev. Lett. {\bf 92}, 057901 (2004), which is called SARG04. This protocol uses the same four states as in BB84 and differs on…
The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, inclu…
