Recently, a novel kind of quantum key distribution called the round-robin differential phase-shift (RRDPS) protocol was proposed, which bounds the amount of leakage without monitoring signal disturbance. The protocol can be implemented by a weak coherent source. The security of this protocol with a simply characterized source has been proved. The application of a common phase shift can improve the secret key rate of the protocol. In practice, the randomized phase is discrete and the secret key rate is deviated from the continuous case. In this study, we analyze security of the RRDPS protocol with discrete-phase-randomized coherent state source and bound the secret key rate. We fix the length of each packet at 32 and 64, then simulate the secret key rates of the RRDPS protocol with discrete-phase randomization and continuous-phase randomization. Our simulation results show that the performance of the discrete-phase randomization case is close to the continuous counterpart with only a small number of discrete phases. The research is practically valuable for experimental implementation.
Recently, a novel kind of quantum key distribution called the round-robin differential phase-shift (RRDPS) protocol was proposed, which bounds the amount of leakage without monitoring signal disturbance. The protocol can be implemented by a weak coherent source. The security of this protocol with a simply characterized source has been proved. The application of a common phase shift can improve the secret key rate of the protocol. In practice, the randomized phase is discrete and the secret key rate is deviated from the continuous case. In this study, we analyze security of the RRDPS protocol with discrete-phase-randomized coherent state source and bound the secret key rate. We fix the length of each packet at 32 and 64, then simulate the secret key rates of the RRDPS protocol with discrete-phase randomization and continuous-phase randomization. Our simulation results show that the performance of the discrete-phase randomization case is close to the continuous counterpart with only a small number of discrete phases. The research is practically valuable for experimental implementation.
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.
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.
Recently, a novel protocol named round-robin differential phase-shift (RRDPS) quantum key distribution [Nature 509, 475(2014)] has been proposed. It can estimate information leakage without monitoring bit error rate. In this paper, we study the performance of RRDPS using heralded single photon source (HSPS) without and with decoy-state method, then compare it with the performance of weak coherent pulses (WCPs). From numerical simulation, we can see that HSPS performs better especially for shorter packet and higher bit error rate. Moreover, we propose a general theory of decoy-state method for RRDPS protocol based on only three decoy states and one signal state. Taking WCPs as an example, the three-intensity decoy-state protocol can distribute secret keys over a distance of 128 km when the length of pulses packet is 32, which confirms great practical interest of our method.
Among many quantum key distribution protocols, the round-robin differential-phase-shift (RRDPS) protocol is unique in that it can upper-bound the amount of information leakage without monitoring signal disturbance. To expedite implementation of the protocol, however, the number of pulses forming a single block should be kept small, which significantly decreases the key rates in the original security proof. In the present paper, we refine the security proof of the RRDPS protocol in the finite-sized regime and achieve a tighter estimation for the information leakage with neither monitoring signal disturbance nor changing the original experimental setups. As a consequence, we obtain better key rates in both asymptotic and finite-sized cases while keeping the preferable features of the protocol, such as omission of phase randomization.
Round-robin-differential-phase (RRDPS) quantum key distribution (QKD) protocol has attracted intensive studies due to its distinct security characteristic, e.g., information leakage in RRDPS can be bounded without learning error rate of key bits. Nevertheless, its implementation is still far from practical due to the complication of its measurement device. Moreover, on the theoretical side, its security is still not clear in view of error rate. Here, by observing a potential phase randomization in the encoding states, we develop a theory to bound information leakage quite tightly and differently. Besides, the error rate is incorporated to improve the secret key rate, which is significant for the understanding of RRDPS. Based on our novel security proof, the practicality and performance of RRDPS can be both improved dramatically. Furthermore, we realize an experiment up to 140km fiber distance which is the longest achievable distance of RRDPS system until now, while the original security proof predicts no secret key can be generated in our experiment. Our results pave an avenue towards practical RRDPS.
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.