Typical security proofs for quantum key distribution (QKD) rely on having some model for the devices, with the security guarantees implicitly relying on the values of various parameters of the model, such as dark count rates or detector efficiencies. Hence to deploy QKD in practice, we must establish how to certify or characterize the model parameters of a manufacturer’s QKD devices. We present a rigorous framework for analyzing such procedures, laying out concrete requirements for both the security proofs and the certification or characterization procedures. In doing so, we describe various forms of conclusions that can and cannot be validly drawn from such procedures, addressing some potential misconceptions. We also discuss connections to composable security frameworks and some technical aspects that remain to be resolved in that direction.
Typical security proofs for quantum key distribution (QKD) rely on having some model for the devices, with the security guarantees implicitly relying on the values of various parameters of the model, such as dark count rates or detector efficiencies. Hence to deploy QKD in practice, we must establish how to certify or characterize the model parameters of a manufacturer’s QKD devices. We present a rigorous framework for analyzing such procedures, laying out concrete requirements for both the security proofs and the certification or characterization procedures. In doing so, we describe various forms of conclusions that can and cannot be validly drawn from such procedures, addressing some potential misconceptions. We also discuss connections to composable security frameworks and some technical aspects that remain to be resolved in that direction.
Quantum key distribution (QKD) promises information-theoretic security based on quantum mechanics and idealized device models. Practical implementations, however, deviate from these models due to unavoidable device imperfections, and existing security proofs fall short of capturing the complexity of real-world systems. Here we introduce a versatile numerical finite-key security framework valid against general coherent attacks and applicable to a broad class of practical QKD setups. It accommodates most relevant imperfections at both transmitter and receiver, including non-independent-and-identically-distributed (non-IID) signals arising in high-speed QKD systems due to the limited bandwidth of optical modulators, while requiring only partial characterization of the apparatuses. We demonstrate the power of our framework by proving the security of a realistic decoy-state QKD implementation with laser sources, providing a practical route towards rigorous security certification of real-world QKD setups.
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.
Abstract One of the most important obstacles for the social deployment of Quantum Key Distribution (QKD) systems is the lack of standards for security certification. Proper selection of application will circumvent other obstacles, such as cost, key generation distance, and rate. Nevertheless, security certification of real systems, or “implementation security certification” is indispensable. Such certification should be clear and tractable for non‐experts and should be performed with standardized characterization methods. Otherwise, the potential users cannot adopt the QKD system with confidence, because the highest level of security is what QKD appeals. This report discusses the process of the implementation security certification and the requirements for device characterization. It also presents several case studies on the requirements and experimental characterization of QKD devices for the security certification.
Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations.The corresponding security proofs usually assume that all physical detectors have the same detection efficiency.However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors.A mismatch can also be induced as the different spatialtemporal modes of an incoming signal might couple differently to a detector.Here we develop a method that allows to provide security proofs without the usual assumption.Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary.Especially, we do not rely on any photon-number cutoff of incoming signals such that our security proof is directly applicable to practical situations.We illustrate our method for a receiver that is designed for polarization encoding and is sensitive to a number of spatial-temporal modes.In our detector model, the absence of quantum interference between any pair of spatial-temporal modes is assumed.For a QKD protocol with this detector model, we can perform a security proof with characterized efficiency mismatch and without photon-number cutoff assumption.Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary.
We present a rigorous and complete security proof of the decoy-state BB84 quantum key distribution (QKD) protocol. Our analysis aims to achieve a high standard of mathematical rigour and completeness, thereby providing the necessary foundation for certification and standardization efforts. Beyond establishing the security of a specific protocol, this work develops a general and modular framework that can be readily adapted to a broad class of QKD protocols, including both prepare-and-measure and entanglement-based variants. Our framework unifies all major ingredients required for the analysis of realistic QKD protocols, including the analysis of classical authentication and classical processing, source-replacement schemes, finite-size analysis, source maps, squashing maps, and decoy-state techniques. In doing so, this work consolidates a diverse range of techniques scattered across the QKD literature into a unified formalism, representing a general and rigorous treatment of QKD security. Finally, it outlines a clear path towards incorporating practical imperfections within the same framework, thereby laying the groundwork for addressing implementation security in future analysis.
Abstract To guarantee the security of quantum key distribution (QKD), security proofs of QKD protocols have assumptions on the devices. Commonly used assumptions are, for example, each random bit information chosen by a sender to be precisely encoded on an optical emitted pulse and the photon-number probability distribution of the pulse to be exactly known. These typical assumptions imposed on light sources such as the above two are rather strong and would be hard to verify in practical QKD systems. The goal of the paper is to replace those strong assumptions on the light sources with weaker ones. In this paper, we adopt the differential-phase-shift (DPS) QKD protocol and drastically mitigate the requirements on light sources, while for the measurement unit, trusted and photon-number-resolving detectors are assumed. Specifically, we only assume the independence among emitted pulses, the independence of the vacuum emission probability from a chosen bit, and upper bounds on the tail distribution function of the total photon number in a single block of pulses for single, two and three photons. Remarkably, no other detailed characterizations, such as the amount of phase modulation, are required. Our security proof significantly relaxes demands for light sources, which paves a route to guarantee implementation security with simple verification of the devices.