The security of quantum key distribution (QKD) relies on the Heisenberg uncertainty principle, with which legitimate users are able to estimate information leakage by monitoring the disturbance of the transmitted quantum signals. Normally, the disturbance is reflected as bit flip errors in the sifted key; thus, privacy amplification, which removes any leaked information from the key, generally depends on the bit error rate. Recently, a round-robin differential-phase-shift QKD protocol for which privacy amplification does not rely on the bit error rate (Sasaki et al 2014 Nature 509 475) was proposed. The amount of leaked information can be bounded by the sender during the state-preparation stage and hence, is independent of the behavior of the unreliable quantum channel. In our work, we apply the tagging technique to the protocol and present a tight bound on the key rate and employ a decoy-state method. The effects of background noise and misalignment are taken into account under practical conditions. Our simulation results show that the protocol can tolerate channel error rates close to 50% within a typical experiment setting. That is, there is a negligible restriction on the error rate in practice.
The security of quantum key distribution (QKD) relies on the Heisenberg uncertainty principle, with which legitimate users are able to estimate information leakage by monitoring the disturbance of the transmitted quantum signals. Normally, the disturbance is reflected as bit flip errors in the sifted key; thus, privacy amplification, which removes any leaked information from the key, generally depends on the bit error rate. Recently, a round-robin differential-phase-shift QKD protocol for which privacy amplification does not rely on the bit error rate (Sasaki et al 2014 Nature 509 475) was proposed. The amount of leaked information can be bounded by the sender during the state-preparation stage and hence, is independent of the behavior of the unreliable quantum channel. In our work, we apply the tagging technique to the protocol and present a tight bound on the key rate and employ a decoy-state method. The effects of background noise and misalignment are taken into account under practical conditions. Our simulation results show that the protocol can tolerate channel error rates close to 50% within a typical experiment setting. That is, there is a negligible restriction on the error rate in practice.
The security of quantum key distribution (QKD) relies on the Heisenberg uncertainty principle, with which legitimate users are able to estimate information leakage by monitoring the disturbance of the transmitted quantum signals. Normally, the disturbance is reflected as bit flip errors in the sifted key; thus, privacy amplification, which removes any leaked information from the key, generally depends on the bit error rate. Recently, a round-robin differential-phase-shift QKD protocol for which privacy amplification does not rely on the bit error rate [Nature 509, 475 (2014)] was proposed. The amount of leaked information can be bounded by the sender during the state-preparation stage and hence, is independent of the behaviour of the unreliable quantum channel. Considering the essence of this protocol, we present a tight bound on the key rate and employ a decoy-state method. The effects of background noise and misalignment are taken into account under practical conditions. Our simulation results show that the protocol can tolerate channel error rates of close to 50% within a typical experiment setting. That is, there is no restriction on the error rate in practice.
In quantum key distribution (QKD), the bit error rate is used to estimate the information leakage and hence determines the amount of privacy amplification-making the final key private by shortening the key. In general, there exists a threshold of the error rate for each scheme, above which no secure key can be generated. This threshold puts a restriction on the environment noises. For example, a widely used QKD protocol, the Bennett-Brassard protocol, cannot tolerate error rates beyond 25%. A new protocol, round-robin differential phase-shifted (RRDPS) QKD, essentially removes this restriction and can in principle tolerate more environment disturbance. Here, we propose and experimentally demonstrate a passive RRDPS QKD scheme. In particular, our 500 MHz passive RRDPS QKD system is able to generate a secure key over 50 km with a bit error rate as high as 29%. This scheme should find its applications in noisy environment conditions.
We propose a new scheme of quantum key distribution (QKD) called the round-robin differential-phase-shift (RRDPS) protocol, which is based on a principle entirely different from the conventional QKD protocols based on the information-disturbance trade off. In the RRDPS protocol, the amount of privacy amplification is essentially constant and there is no need to change it according to the observed amount of disturbance. This means that it is hard for an eavesdropper to guess the bit value regardless of the amount of disturbance she has caused. The new scheme has a better tolerance on bit errors and is free from the cost of monitoring eavesdropping attempts. In contrast to the conventional QKD schemes, the amount of privacy amplification is the same even if the quality of the transmission channel becomes poorer and the bit error rate increases. This leads to a higher bit error threshold, typically over 30% and with no theoretical bound less than 50%. The fact that the protocol does not require precise estimation of the amount of signal disturbance is advantageous when the finite-key effect is taken into account; the RRDPS protocol can produce a key even when the total number of transmitted bits is small.
In recent years, round-robin-differential-phase-shift (RRDPS) quantum key distribution (QKD) has attracted great attention for its unique characteristics, i.e., the information leakage can be bounded without learning bit error rate. Though the RRDPS QKD has made a breakthrough, it is still a question of how RRDPS will perform with monitoring signal disturbance, e.g., decoy-state and error rate statistics are both used. Here, we present simulations to study RRDPS protocol while monitoring signal disturbance. To our excitement, when using the infinite decoy-states method, RRDPS protocol can outperform the commonly used Bennett and Brassard 1984 (BB84) protocol in terms of channel length under typical experimental parameters. In the case of finite decoy states, we find that only two decoy-states and one signal state are sufficient to obtain performance very close to the infinite decoy-states case. Our simulations prove that RRDPS is a competitive protocol in real-life situations.
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Many of the QKD protocols that were introduced in the past, involve the challenge of monitoring the signal disturbance over the communication line, in order to evaluate the information leakage to a potential eavesdropper. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. Here, we propose an improved version of this so-called round-robin differential phase-shifting (RRDPS) protocol, in which both time and phase degrees of freedom are utilized to enlarge the Hilbert-space dimensionality, without increasing experimental complexity or relaxing security assumptions. We derive the security proofs of the round-robin differential phase-time-shifting (RRDPTS) protocol in the collective attack scenario, and benchmark it against RRDPS for different experimental parameters. Furthermore, a proof-of-concept experiment of the RRDPTS protocol, using weak coherent pulses and decoy state method, is demonstrated over 80 km of fiber link. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
The round-robin-differential-phase-shift (RRDPS) quantum key distribution (QKD) protocol has attracted intensive study due to its distinct security characteristics; e.g., information leakage is bounded without learning the error rate of key bits. Nevertheless, its practicality and performance are still not satisfactory. Here, by observing the phase randomization of the encoding states and its connection with eavesdropper's attack, we develop an improved bound on information leakage. Interestingly, our theory is especially useful for implementations with short trains of pulses, and running without monitoring signal disturbance is still available. As a result, the practicality and performance of RRDPS are improved. Furthermore, we realize a proof-of-principle experiment with up to 140 km of fiber, which has been the longest achievable distance of RRDPS until now, whereas the original theory predicted that no secret key could be generated in our experiment. Our results will help in bringing practical RRDPS closer to practical implementations.