Searcharxiv⌕ Search

arXiv subjects

Jerome Wiesemann

Publications and source records attributed to Jerome Wiesemann.

3 recordsLinked to original sources

Security framework for practical quantum key distribution with imperfect devices

Practical quantum key distribution (QKD) systems inevitably exhibit imperfections in both the source and detector. At the same time, the behavior of these imperfect devices is never exactly known due to characterization uncertainty, parameter fluctuations, and potential influence by an adversary. In this work, we present a security proof for generic prepare-and-measure QKD protocols, including decoy-state BB84, with imperfect and imperfectly characterized sources and detectors using the marginal-constrained entropy accumulation theorem (MEAT). Our approach uses a sequence of proof technique independent source maps and squashing maps, yielding a very modular framework. We show that practical key rates can be achieved even when multiple imperfections are combined. More broadly, our work provides a unified foundation that avoids the need for dedicated protocol-specific arguments and can be readily extended to other protocols and device imperfections.

quant-ph↗

A consolidated and accessible security proof for finite-size decoy-state quantum key distribution

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.

quant-ph↗

Evaluation of quantum key distribution systems against injection-locking attacks

While ideal quantum key distribution (QKD) systems are well-understood, practical implementations face various vulnerabilities, such as side-channel attacks resulting from device imperfections. Current security proofs for decoy-state BB84 protocols either assume uniform phase randomization of Alice's signals, which is compromised by practical limitations and attacks like injection locking, or rely on a (partially) characterized phase distribution. This work presents an experimental method to characterize the phase de-randomization from injection locking using a heterodyne detection setup, providing a lower bound on the degree of isolation required to protect QKD transmitters against injection-locking attacks. The methods presented are source-agnostic and can be used to evaluate general QKD systems against injection-locking attacks.

quant-ph↗