In this paper, we present a flowchart-based description of the decoy-state BB84 quantum key distribution (QKD) protocol and provide a step-by-step, self-contained information-theoretic security proof for this protocol within the universal composable security framework. As a result, our proof yields a key rate consistent with previous findings. Importantly, unlike all the prior security proofs, our approach offers a fully rigorous and mathematical justification for achieving the key rate with the claimed correctness and secrecy parameters, thereby representing a significant step toward the formal certification of QKD systems.
In this paper, we present a flowchart-based description of the decoy-state BB84 quantum key distribution (QKD) protocol and provide a step-by-step, self-contained information-theoretic security proof for this protocol within the universal composable security framework. As a result, our proof yields a key rate consistent with previous findings. Importantly, unlike all the prior security proofs, our approach offers a fully rigorous and mathematical justification for achieving the key rate with the claimed correctness and secrecy parameters, thereby representing a significant step toward the formal certification of QKD systems.
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.
In recent years, quantum key distribution (QKD) has evolved from a scientific research field to a commercially available security solution, supported by mathematically formulated security proofs. However, since the knowledge required for a full understanding of a security proof is scattered across numerous publications, it has proven difficult to gain a comprehensive understanding of all steps involved in the process and their limitations without considerable effort and attention to detail. Our paper aims to address this issue by providing a rigorous and comprehensive security proof for the finite-size 1-decoy and 2-decoy BB84 protocols against coherent attacks within Renner's entropic uncertainty relation framework. We resolve important technical flaws found in previous works regarding the fixed-length treatment of protocols and the careful handling of acceptance testing. To this end, we provide various technical arguments, including an analysis accounting for the important distinction of the 1-decoy protocol where statistics are computed after error correction, along with a slight improvement of the secure-key length. We also explicitly clarify the aspect of conditioning on events, addressing a technical detail often overlooked and essential for rigorous proofs. We extensively consolidate and unify concepts from many works, thoroughly discussing the underlying assumptions and resolving technical inconsistencies. Therefore, our contribution represents a significant advancement towards a broader and deeper understanding of QKD security proofs.
Quantum key distribution (QKD) protocols make it possible for two parties to generate a secret shared key. One of the most important QKD protocols, BB84, was suggested by Bennett and Brassard in 1984. Various proofs of unconditional security for BB84 have been suggested, but the first security proofs were not composable. Here we improve a security proof of BB84 given by [Biham, Boyer, Boykin, Mor, and Roychowdhury, J. Cryptology, 19(4):381-439, 2006] to be composable and match the state-of-the-art results for BB84, and we extend it to prove unconditional security of several variants of the BB84 protocol. Our composable security proof for BB84 and its variants is mostly self-contained, algebraic, and relatively simple, and it gives tight finite-key bounds.
The decoy-state Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passiveand active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.
Quantum key distribution (QKD) promises provably secure communications. In order to improve the secret key rate, combining a biased basis choice with the decoy-state method is proposed. Concomitantly, there is a basis-independent detection efficiency condition, which usually cannot be satisfied in a practical system, such as the time-phase encoding. Fortunately, this flaw has been recently removed theoretically and experimentally in the four-intensity decoy-state BB84 QKD protocol using the fact that the expected yields of single-photon states prepared in two bases stay the same for a given measurement basis. However, the security proofs do not fully consider the finite-key effects for general attacks. In this work, we provide the rigorous finite-key security bounds in the universally composable framework for the four-intensity decoy-state BB84 QKD protocol. We build a time-phase encoding system with 200 MHz clock to implement this protocol, in which the real-time secret key rate is more than 60 kbps over 50 km single-mode fiber.
Practical quantum key distribution (QKD) modulators inevitably introduce correlations, causing the state emitted in a given round to depend on the setting choices made in previous rounds. These correlations break the round-by-round independence structure on which many widely used security proof techniques rely, leaving a significant gap between available theoretical guarantees and the reality of practical implementations. In this work, we develop a fully analytical finite-key security proof for decoy-state BB84 against general coherent attacks that rigorously incorporates correlations introduced by Alice's bit-and-basis encoder, while requiring only partial characterization of such correlations. Crucially, it does so without requiring the round partitioning of the data used for phase-error estimation introduced in previous works, showing that this technique is not indispensable for dealing with correlated encoders, and resulting in improved finite-key performance. Moreover, we also analyze the case of ideal single-photon sources, and our results reveal a counterintuitive effect: in the presence of strong encoding correlations, decoy-state BB84 can outperform single-photon implementations.