Practical quantum key distribution (QKD) receivers may leak information about their measurement outcomes and settings to the channel (e.g., through detector backflashes or back-reflected Trojan-horse light) that could compromise the protocol's security. Here we present a simple finite-key security proof based on phase-error estimation for prepare-and-measure QKD in the presence of either a priori information leakage about the basis choices and/or a posteriori information leakage about the measurement outcomes. The proof requires only a bound on the distinguishability of the side-channel states. Furthermore, the analysis is modular and compatible with existing security proofs that address detector and source imperfections, making it applicable to a wide range of practical QKD implementations.
Practical quantum key distribution (QKD) receivers may leak information about their measurement outcomes and settings to the channel (e.g., through detector backflashes or back-reflected Trojan-horse light) that could compromise the protocol's security. Here we present a simple finite-key security proof based on phase-error estimation for prepare-and-measure QKD in the presence of either a priori information leakage about the basis choices and/or a posteriori information leakage about the measurement outcomes. The proof requires only a bound on the distinguishability of the side-channel states. Furthermore, the analysis is modular and compatible with existing security proofs that address detector and source imperfections, making it applicable to a wide range of practical QKD implementations.
Quantum key distribution promises information-theoretic security, but practical implementations face vulnerabilities due to device imperfections. Existing security proofs typically address source and detector imperfections separately and cannot be directly combined, while the few attempts to handle both simultaneously have assumed idealized scenarios with infinitely many protocol rounds, which is insufficient to certify the security of real-world systems. Here, we close this gap by introducing a modular lifting theorem that extends any (present or future) phase-error-based security proof for active-basis-choice BB84-type protocols to incorporate detector efficiency mismatches. By applying this theorem to a state-of-the-art analysis for source imperfections, we obtain the first finite-key security proof against general coherent attacks that simultaneously addresses both source and detector imperfections.
Decoy-state quantum key distribution (QKD) is the most widely adopted approach for overcoming the limitations of imperfect single-photon sources. However, existing security proofs typically either neglect important device imperfections or rely on assumptions that are difficult to justify in realistic high-speed implementations, such as the independent and identically distributed nature of the emitted signals. In this work, we combine and extend several recent theoretical advances to provide a comprehensive analytical finite-key security proof for decoy-state QKD that simultaneously incorporates multiple practically relevant transmitter and receiver imperfections, including state-preparation flaws, bit and basis side-channel leakage and correlations, setting-independent intensity fluctuations, and detection-efficiency mismatches.
We prove the security of phase-encoded decoy-state BB84 quantum key distribution for a Mach-Zehnder receiver with imbalanced beam splitters and two threshold detectors that leak fine-grained information about the detection patterns. For this, we derive a lower bound on Bob's single-photon contributions and combine it with the decoy-state method and a recent phase-error framework for leaky receivers. The leakage-induced correction to the phase-error rate is independent of channel loss, providing a loss-tolerant treatment of receiver leakage even in the presence of beam-splitter imbalance. Our results provide a practical route toward loss-tolerant security proofs for imperfect QKD receivers in the presence of receiver leakage.
Security proofs of quantum key distribution (QKD) typically assume that the devices of the legitimate users are perfectly shielded from the eavesdropper. This assumption is, however, very hard to meet in practice, and thus the security of current QKD implementations is not guaranteed. Here, we fill this gap by providing a finite-key security analysis for QKD which is valid against arbitrary information leakage from the state preparation process of the legitimate users. For this, we extend the techniques introduced by Tamaki et al (2016 New J. Phys. 18 065008) to the finite-key regime, and we evaluate the security of a leaky decoy-state BB84 protocol with biased basis choice, which is one of the most implemented QKD schemes today. Our simulation results demonstrate the practicability of QKD over long distances and within a reasonable time frame given that the legitimate users' devices are sufficiently isolated.
Abstract Most security proofs of quantum key distribution (QKD) assume that there is no unwanted information leakage about the state preparation process. However, this assumption is impossible to guarantee in practice, as QKD systems can leak information to the channel due to device imperfections or the active action of an eavesdropper. Here, we solve this pressing issue by introducing a security proof in the presence of information leakage from all state preparation settings for arguably the most popular QKD scheme, namely the decoy-state BB84 protocol. The proof requires minimal experimental characterization, as only a single parameter related to the isolation of the source needs to be determined, thus providing a clear path for bridging the gap between theory and practice. Moreover, if information about the state of the side channels is available, this can be readily incorporated into the analysis to further improve the resulting performance.
Every quantum key distribution (QKD) protocol must limit the information available outside the users' laboratories. In device-independent QKD this is essentially the only assumption made on the devices. In a prepare-and-measure setting it cannot be imposed strictly, since the sender's device must emit a signal that depends on her private input. The natural replacement, and a minimal one, is a leakage bound: a bound on how much information about the input leaves the sender's laboratory, through the intended signal or through any side channel. We ask how far this unavoidable requirement can replace a detailed model of the source. We show that this single bound, quantified by the probability of guessing the input from everything the source emits, suffices to prove security against collective attacks. In our analysis, nothing is assumed about the precise form of the emitted states, their dimension, energy or purity, nor about the receiver's measurement device, beyond the standard requirement that it does not leak Bob's data. The standard B92 and BB84 protocols do not certify any key under this minimal leakage bound assumption. But closely related protocols can and, in the ideal limit, achieve one secret bit per key round. For noisy implementations, we compute key rates using semidefinite programming relaxations. Our best protocols tolerate visibilities down to 0.84, corresponding to an 8% quantum bit error rate, compared with the 11% threshold of standard device-dependent BB84.