The core of security proofs of quantum key distribution (QKD) is the estimation of a parameter that determines the amount of privacy amplification that the users need to apply in order to distill a secret key. To estimate this parameter using the observed data, one needs to apply concentration inequalities such as random sampling theory or Azuma's inequality. The latter can be straightforwardly employed in a wider class of QKD protocols, including those that do not rely on basis-independent sources such as the loss-tolerant (LT) protocol. However, when applied to real-life finite-length QKD experiments, Azuma's inequality typically results in substantially lower secret-key rates. Here we propose an alternative security analysis of the LT protocol against general attacks, for both its prepare-and-measure and measurement-device-independent versions, that is based on random sampling theory. Consequently, our security proof provides considerably higher secret-key rates than the previous finite-key analysis based on Azuma's inequality. This work opens up the possibility of using random sampling theory to provide alternative security proofs for other QKD protocols.
The core of security proofs of quantum key distribution (QKD) is the estimation of a parameter that determines the amount of privacy amplification that the users need to apply in order to distill a secret key. To estimate this parameter using the observed data, one needs to apply concentration inequalities such as random sampling theory or Azuma's inequality. The latter can be straightforwardly employed in a wider class of QKD protocols, including those that do not rely on basis-independent sources such as the loss-tolerant (LT) protocol. However, when applied to real-life finite-length QKD experiments, Azuma's inequality typically results in substantially lower secret-key rates. Here we propose an alternative security analysis of the LT protocol against general attacks, for both its prepare-and-measure and measurement-device-independent versions, that is based on random sampling theory. Consequently, our security proof provides considerably higher secret-key rates than the previous finite-key analysis based on Azuma's inequality. This work opens up the possibility of using random sampling theory to provide alternative security proofs for other QKD protocols.
Abstract Unlike traditional communication, quantum key distribution (QKD) can reach unconditional security and thus attracts intensive studies. Among all existing QKD protocols, round-robin-differential-phase-shift (RRDPS) protocol can be running without monitoring signal disturbance, which significantly simplifies its flow and improves its tolerance of error rate. Although several security proofs of RRDPS have been given, a tight finite-key analysis with a practical phase-randomized source is still missing. In this paper, we propose an improved security proof of RRDPS against the most general coherent attack based on the entropic uncertainty relation. What’s more, with the help of Azuma’s inequality, our proof can tackle finite-key effects primely. The proposed finite-key analysis keeps the advantages of phase randomization source and indicates experimentally acceptable numbers of pulses are sufficient to approach the asymptotical bound closely. The results shed light on practical QKD without monitoring signal disturbance.
Quantum key distribution (QKD) allows two users to generate a random secret key, which they can use to securely exchange a message. Unlike many other cryptographic schemes, QKD offers information-theoretical security based on the laws of physics. In recent years, major theoretical and experimental advancements have been made. Among these are two novel protocols, memory-assisted (MA) QKD and twin-field (TF) QKD, which can both improve the secret-key rate scaling with channel length, potentially allowing QKD to be performed at longer distances. The main motivation of this thesis is to incorporate more realistic assumptions into the security proofs and performance analyses of these new protocols. \n \n \nOne common assumption made in QKD security proofs is that the protocol is run for an infinitely long time, which allows the users to obtain a perfect statistical characterisation of the quantum channel. In this thesis, we drop this assumption for a TF-QKD variant that is well suited for experimental implementation, proving its security in the finite-key regime. We also analyse the finite-key performance of MA-QKD, concluding that it is particularly resistant to its statistical fluctuation effects. Moreover, we develop an alternative finite-key security analysis approach based on random sampling theory, and apply it to the loss-tolerant protocol, which can ensure security in the presence of flawed sources. Compared to previous finite-key security proofs of the protocol, our analysis offers better performance. \n \n \nAnother common assumption is that the users can emit laser pulses with a continuous random phase. In practice, this is difficult to achieve, and the phase is often randomised discretely. In this thesis, we prove the security of a TF-QKD variant that relies on discrete phase randomisation, and show that, using certain post-selection techniques, it can provide higher secret-key rates than an equivalent continuously-randomised protocol.
The security of finite-length keys is essential for the implementation of device-independent quantum key distribution (DIQKD). Presently, there are several finite-size DIQKD security proofs, but they are mostly focused on standard DIQKD protocols and do not directly apply to the recent improved DIQKD protocols based on noisy preprocessing, random key measurements, and modified CHSH inequalities. Here, we provide a general finite-size security proof that can simultaneously encompass these approaches, using tighter finite-size bounds than previous analyses. In doing so, we develop a method to compute tight lower bounds on the asymptotic keyrate for any such DIQKD protocol with binary inputs and outputs. With this, we show that positive asymptotic keyrates are achievable up to depolarizing noise values of 9.33% , exceeding all previously known noise thresholds. We also develop a modification to random-key-measurement protocols, using a pre-shared seed followed by a "seed recovery" step, which yields substantially higher net key generation rates by essentially removing the sifting factor. Some of our results may also improve the keyrates of device-independent randomness expansion.
Abstract Several quantum key distribution (QKD) protocols employ iterative sifting. After each quantum transmission round, Alice and Bob disclose part of their setting information (including their basis choices) for the detected signals. This quantum phase then ends when the basis dependent termination conditions are met, i.e., the numbers of detected signals per basis exceed certain pre-agreed threshold values. Recently, however, Pfister et al (2016 New J. Phys. 18 053001) showed that the basis dependent termination condition makes QKD insecure, especially in the finite key regime, and they suggested to disclose all the setting information after finishing the quantum phase. However, this protocol has two main drawbacks: it requires that Alice possesses a large memory, and she also needs to have some a priori knowledge about the transmission rate of the quantum channel. Here we solve these two problems by introducing a basis-independent termination condition to the iterative sifting in the finite key regime. The use of this condition, in combination with Azuma’s inequality, provides a precise estimation on the amount of privacy amplification that needs to be applied, thus leading to the security of QKD protocols, including the loss-tolerant protocol (Tamaki et al 2014 Phys. Rev. A 90 052314), with iterative sifting. Our analysis indicates that to announce the basis information after each quantum transmission round does not compromise the key generation rate of the loss-tolerant protocol. Our result allows the implementation of wider classes of classical post-processing techniques in QKD with quantified security.
Differential-phase-shift (DPS) quantum key distribution (QKD) is one of the major QKD protocols that can be implemented with a simple setup using a laser source and a passive detection unit. Recently, an information-theoretic security proof of this protocol was established by Mizutani et al. [npj Quantum Inf. 5, 87 (2019)], assuming an infinitely large number of emitted pulses. To implement the DPS protocol in a real-life world, it is indispensable to analyze the security with the finite number of emitted pulses. The extension of the security proof to the finite-size regime requires the accommodation of the statistical fluctuations to determine the amount of privacy amplification. In doing so, Azuma's inequality is often employed, but unfortunately we show that in the case of the DPS protocol, this results in a substantially low key rate. This low key rate is due to a loose estimation of the sum of probabilities regarding three-photon emission whose probability of occurrence is very small. The main contribution of our work is to show that this obstacle can be overcome by exploiting the recently found novel concentration inequality, Kato's inequality. As a result, the key rate of the DPS protocol is drastically improved. For instance, assuming typical experimental parameters, a 3-Mbit secret key can be generated over 77 km for 8.3 hours, which shows the feasibility of DPS QKD under a realistic setup.
Measurement-device-independent quantum key distribution (MDI-QKD) is immune to detector side channel attacks, which is a notorious security loophole problem in QKD. Importantly, both finite-key effects and intensity fluctuations of the practical photon sources are nonnegligible in a full key rate analysis of practical QKD. In this paper, for the case with finite-key effects and without intensity fluctuations, we present a way to estimate the phase error rate for MDI-QKD and compare performances of the parameter estimation based on Hoeffding’s inequality and the Chernoff bound. By using Azuma’s inequality, we also present the finite-key analysis with composable security against general attacks for a biased decoy-state MDI-QKD protocol with intensity fluctuations. Our simulation results show that the effect of our phase error rate estimation is almost the same as the results in Phys. Rev. A91, 022313 (2015)PLRAAN1050-294710.1103/PhysRevA.91.022313, and the parameter estimation using the Chernoff bound is tighter than that using Hoeffding’s inequality. In addition, the influence of intensity fluctuations is more obvious when the data size of total transmitting signals is small. Our results highlight that it is important to keep the stability of the intensity modulator and estimate accurately the emitted pulse’s intensity for practical implementations.