We present a security proof for variable-length QKD in the Renner framework against IID collective attacks. Our proof can be lifted to coherent attacks using the postselection technique. Our first main result is a theorem to convert a sequence of security proofs for fixed-length protocols satisfying certain conditions to a security proof for a variable-length protocol. This conversion requires no new calculations, does not require any changes to the final key lengths or the amount of error-correction information, and at most doubles the security parameter. Our second main result is the description and security proof of a more general class of variable-length QKD protocols, which does not require characterizing the honest behavior of the channel connecting the users before the execution of the QKD protocol. Instead, these protocols adaptively determine the length of the final key, and the amount of information to be used for error correction, based upon the observations made during the protocol. We apply these results to the qubit BB84 protocol, and show that variable-length implementations lead to higher expected key rates than the fixed-length implementations. Published by the American Physical Society 2024
We present a security proof for variable-length QKD in the Renner framework against IID collective attacks. Our proof can be lifted to coherent attacks using the postselection technique. Our first main result is a theorem to convert a sequence of security proofs for fixed-length protocols satisfying certain conditions to a security proof for a variable-length protocol. This conversion requires no new calculations, does not require any changes to the final key lengths or the amount of error-correction information, and at most doubles the security parameter. Our second main result is the description and security proof of a more general class of variable-length QKD protocols, which does not require characterizing the honest behavior of the channel connecting the users before the execution of the QKD protocol. Instead, these protocols adaptively determine the length of the final key, and the amount of information to be used for error correction, based upon the observations made during the protocol. We apply these results to the qubit BB84 protocol, and show that variable-length implementations lead to higher expected key rates than the fixed-length implementations. Published by the American Physical Society 2024
This thesis is concerned with rigorous security analyses of practical Quantum Key Distribution (QKD) protocols, using a variety of modern proof techniques. The main results are as follows. First, we establish a security proof for variable-length QKD protocols against IID collective attacks, and extend this result to coherent attacks using the postselection technique. In doing so, we resolve a long-standing flaw in the application of the postselection technique to QKD, thereby placing it on a rigorous mathematical footing. Second, we develop a method to bound phase error rates in entropic uncertainty relation-based and phase error rate-based proofs, using only the observed statistics of the protocol, even when detectors are imperfect and only approximately characterized. This removes a key assumption of identical detector behaviour and enables these techniques to be applied in realistic settings. Third, we present a very general security analysis based on the marginal-constrained entropy accumulation theorem. The resulting framework can be readily adapted to practical imperfections and side channels, and is suitable for certification efforts. Finally, we show that the security of QKD protocols under realistic authentication assumptions can be reduced to the standard idealized setting, where authentication is assumed to behave honestly, with only minor protocol modifications. A distinctive feature of this thesis is its unified presentation of several major QKD security proof frameworks using consistent protocol descriptions and notation. Consequently, this thesis is intended not only as a collection of new technical results, but also as a useful reference for understanding rigorous security analysis in quantum key distribution.
By applying the framework of entropic uncertainty relation (EUR) and the Quantum Leftover Hash Lemma (QLHL), we introduce a security-proof method for variable-length side-channel-secure (SCS) quantum key distribution (QKD) against coherent attacks. This method reframes composable security as a statistical fluctuation problem of phase errors, enabling direct proofs against coherent attacks through observables and virtual observables. It yields tight key rates for the SCS protocol and reduces pulse requirements by over two orders of magnitude compared to prior works that employ the post-selection technique. {Utilizing the characteristic of the SCS protocol that it has no untagged-bit bit-flip errors, we prove that the secure key length for the SCS protocol can be determined after Cascade error correction, using its actual parity disclosures. We also explain how the same argument extends to protocols with compatible bit-error-pattern and phase-error measurements.} We further identify sufficient conditions under which the final key length may be determined after error correction in a broader class of QKD protocols. Under the framework of EUR and QLHL, we clarify the applicability of several commonly used concentration bounds to variable-length QKD and the appropriate manner of their implementation. This work enhances the practical value of the SCS protocol and clarifies the security justification of key-rate formulas used in practical variable-length QKD implementations.
In this thesis we develop practical tools for quantum key distribution (QKD) security proofs. We apply the tools to provide security proofs for several protocols, ranging from discrete variable protocols in high dimensions, protocols with realistic implementations, measurement device independent QKD and continuous-variable QKD. The security proofs are based on the Devetak-Winter security framework [I. Devetak and A. Winter, Proc. of the Roy. Soc. of London Series A, 461, 207 (2005); B. Kraus, N. Gisin, and R. Renner, Phys. Rev. Lett., 95 080501 (2005)]. \n \nIn the key rate calculation, it is often convenient to assume that the optimal attack is symmetric. \nUnder the assumption that the parameter estimation is based on coarse-grained observations, we show that the optimal attack is symmetric, if the protocol and the postselection have sufficient symmetries. \nAs an example we calculate the key rates of protocols using 2, d and d+1 mutually unbiased bases in d-dimensional Hilbert spaces. \n \nWe investigate the connection between the optimal collective eavesdropping attack and the optimal cloning attack, in which the eavesdropper employs an optimal cloner to attack the protocol. \nWe find that, in general, it does not hold that the optimal attack is an optimal cloner. However, there are classes of protocols, for which we can identify the optimal attack by an optimal cloner. \nWe analyze protocols with mutually unbiased bases in d dimensions, and show that for the protocols with 2 and d+1 mutually unbiased bases the optimal attack is an optimal cloner, but for the protocols with d mutually unbiased bases, it is not. \n \nIn optical implementations of the phase-encoded BB84 protocol, the bit information is usually encoded in the phase of two consecutive photon pulses generated in a Mach-Zehnder interferometer. In the actual experimental realization, the loss in the arms of the Mach-Zehnder interferometer is not balanced, for example because only one arm contains a lossy phase modulator. \nSince the imbalance changes the structure of the signals states and measurements, the BB84 security analysis no longer applies in this scenario. \nWe provide a security proof for the unbalanced phase-encoded BB84. The loss does lower the key rate compared to a protocol without loss. However, for a realistic parameter regime, the same key rate is found by applying the original BB84 security analysis. \n \nRecently, the security of a measurement device-independent QKD setup with BB84 signal states was proven in Refs. [H.-K. Lo, M. Curty, and B. Qi, Phys. Rev. Lett., 108 (2012); S. L. Braunstein and S. Pirandola, Phys. Rev. Lett., 108 (2012)]. In this setup Alice and Bob send quantum states to an intermediate node, which performs the measurement, and is assumed to be controlled by Eve. \nWe analyze the security of a measurement device-independent QKD protocol with B92 signal states, and calculate the key rates numerically for a realistic implementation. \nBased on our security proof we were able to prove the security of the strong reference pulse B92 protocol. \n \nWe analyze the security of continuous-variable protocols using the entropic uncertainty relations established in Ref. [M. Berta, M. Christandl, R. Colbeck, J. M. Renes, and R. Renner, Nature Physics 6, 659 (2010)] to provide an estimate of the key rate based on the observed first and second moments. We analyze a protocol with squeezed coherent states and the 2-state protocol with two coherent states with opposite phases.
Discrete-modulated (DM) continuous-variable quantum key distribution (CV-QKD) protocols are promising candidates for commercial implementations of quantum communication networks due to their experimental simplicity.While tight security analyses in the asymptotic limit exist, proofs in the finitesize regime are still subject to active research.We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol.We introduce a new energy testing theorem to bound the effective dimension of Bob's system and rigorously prove security within Renner's -security framework and address the issue of acceptance sets in protocols and their security proof.We want to highlight that our method also allows for nonunique acceptance statistics, which is necessary in practise.Finally, we extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate.To demonstrate our method, we apply it to a quadrature phase-shift keying protocol for both untrusted, ideal and trusted, nonideal detectors.The results show that our security proof method yields secure finite-size key rates under experimentally viable conditions up to at least 72 km transmission distance.
Quantum key distribution (QKD) can be proved to be secure by laws of quantum mechanics. In this thesis, we review security proof methods in Renner's framework and discuss numerical methods to calculate asymptotic and finite key rates. These methods are highly versatile and applicable to general device-dependent QKD protocols. We also discuss analytical tools that extend the applicability of these numerical methods. We then present the asymptotic security proof against collective attacks for a variant of the twin-field QKD protocol, which can overcome the repeaterless secret-key capacity bound. Our variant reduces the sifting cost and uses non-phase-randomized coherent states as both signals and test states. We confirm the loss scaling of this protocol. Another important family of protocols that we investigate here are discrete-modulated continuous-variable QKD protocols. They are interesting due to their experimental simplicity and their great potential for massive deployment in the quantum-secured networks. Our security proof method can provide tight asymptotic key rates. We demonstrate that the postselection of data in combination with reverse reconciliation can improve the key rates. We analyze both untrusted and trusted detector noise scenarios. Our results in the trusted detector noise scenario show that we can thus cut out most of the effect of detector noise and obtain asymptotic key rates similar to those had we access to ideal detectors. Finally, we present several simple examples to illustrate our newly developed method for the numerical finite-key analysis against the most general attacks via the entropy accumulation theorem.
Quantum Key Distribution, or short QKD, aims to establish a secure key withoutmaking any additional assumptions about the abilities or computational power of an adversary who is only limited by the laws of nature. The process of finding a mathematical expression for, or at least a lower bound on, the secure keyrate of some QKD protocol, given relevant system parameters, is called securityproof. In this thesis, we use a recent numerical security proof technique to examine different post selection strategies for continuous-variable quantum key distribution(CV-QKD) protocols with quadrature phase-shift keying modulation and four or eight signal states. CV-QKD protocols use coherent states to encode information and measure the field-quadrature components by homodyne or heterodyne detection. The basic idea of the used numerical security proof technique is to solve thekey rate finding problem in a two-step process. In the first step, the problem is solved approximately, using a numerical algorithm, which yields an upper bound on the secure key rate. This is followed by step two, where the obtained upperbound is converted into a lower bound, using a sequence of theorems and taking numerical errors into account. Postselection aims to increase the secure key rate by removing those parts of the key, where a potential adversary might have gained more information than the communicating parties. The investigations are carried out both for the untrusted ideal and the trusted non-ideal detector scenario and we provide novel analytical results for the operators related to the postselection map.For four-state protocols, we demonstrate that a new cross-shaped postselectionstrategy out performs the state-of-the-art radial postselection scheme clearly in regions of medium to high transmission distances and medium to high values of noise and performs comparable to a more complicated radial&angular scheme. As the error-correction phase is a known bottleneck for many real QKD systems, we examined the secure key rate when a large fraction of the raw key is removed by postselection. We observe that a smart choice of the postselection strategy can increase the key rate while lowering the raw key rate, hence the computational effort in the error-correction phase. One can think this even further: For cross-shaped postselection we showed that the secure key rate is roughly 80% of the secure keyrate without postselection when only 20% of the raw key passes the postselection.For high noise levels this can be increased even further. The cross-shaped post-selection strategy can easily be implemented in the data processing of both new and existing CV-QKD systems, hence can increase the achievable secure key rate significantly. Furthermore, we examined the radial&angular postselection strategy which combines the advantages of the radial postselection scheme for low transmission distances and those of the cross-shaped postselection scheme for medium and high transmission distances on the cost of higher complexity.Additionally, we examine an eight-state phase-shift keying protocol and compare the obtained key rates to the key rates for the four-state protocol and investigate a radial postselection scheme. We observe that the 8PSK protocol yields higher secure key rates and reaches higher maximal achievable transmission distances than a QPSK protocol with a comparable postselection strategy, in particular for medium to high values of excess noise. Furthermore, we explore the relation between the achievable secure key rate and the probability to pass the postselectionphase for various noise-levels and two different practically relevant reconciliation efficiencies. This leads to similar strategies as found for the QPSK protocols to reduce the raw key rate significantly while decreasing the secure key rate only moderately. For very high values of excess noise, the raw key rate can be increased further compared to the key rate achieved without performing postselection whileremoving a large fraction of the raw key rate.