Abstract The round-robin differential phase shift (RRDPS) quantum key distribution (QKD) protocol is a unique QKD protocol whose security has not been understood through an information-disturbance trade-off relation, and a sufficient amount of privacy amplification was given independently of signal disturbance. Here, we discuss the security of the RRDPS protocol in the asymptotic regime when a good estimate of the bit error rate is available as a measure of signal disturbance. The uniqueness of the RRDPS protocol shows up as a peculiar form of information-disturbance trade-off curve. When the length of a block of pulses used for encoding and the signal disturbance are both small, it provides a significantly better key rate than that from the original security proof. On the other hand, when the block length is large, the use of the signal disturbance makes little improvement in the key rate. Our analysis will bridge a gap between the RRDPS protocol and the conventional QKD protocols.
Abstract The round-robin differential phase shift (RRDPS) quantum key distribution (QKD) protocol is a unique QKD protocol whose security has not been understood through an information-disturbance trade-off relation, and a sufficient amount of privacy amplification was given independently of signal disturbance. Here, we discuss the security of the RRDPS protocol in the asymptotic regime when a good estimate of the bit error rate is available as a measure of signal disturbance. The uniqueness of the RRDPS protocol shows up as a peculiar form of information-disturbance trade-off curve. When the length of a block of pulses used for encoding and the signal disturbance are both small, it provides a significantly better key rate than that from the original security proof. On the other hand, when the block length is large, the use of the signal disturbance makes little improvement in the key rate. Our analysis will bridge a gap between the RRDPS protocol and the conventional QKD protocols.
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.
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.
Since the round-robin-differential-phase-shift (RRDPS) quantum key distribution (QKD) protocol was proposed, it has attracted much attention due to its unique characteristic i.e., it can bind the amount of information leakage without monitoring signal disturbance. Recently, Yin et al. have developed a novel theory to estimate its information leakage tightly. However, the finite-sized key effects are not taken into account. Here, we fill this gap and extend the security proof of the RRDPS protocol to the finite-sized regime using post-selection technique. As a consequence, it's predicted that the key rate of RRDPS in a finite-sized key scenario can be comparable to the asymptotic one, which is meaningful for the real-life applications.
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.
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.
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.