Finite-size analysis of prepare-and-measure and decoy-state QKD via entropy accumulation
arXiv:2406.10198 · doi:10.1103/PRXQuantum.6.020342
Abstract
An important goal in quantum key distribution (QKD) is the task of providing a finite-size security proof without the assumption of collective attacks. For prepare-and-measure QKD, one approach for obtaining such proofs is the generalized entropy accumulation theorem (GEAT), but thus far it has only been applied to study a small selection of protocols. In this work, we present techniques for applying the GEAT in finite-size analysis of generic prepare-and-measure protocols, with a focus on decoy-state protocols. In particular, we present an improved approach for computing entropy bounds for decoy-state protocols, which has the dual benefits of providing tighter bounds than previous approaches (even asymptotically) and being compatible with methods for computing min-tradeoff functions in the GEAT. Furthermore, we develop methods to incorporate some improvements to the finite-size terms in the GEAT, and implement techniques to automatically optimize the min-tradeoff function. Our approach also addresses some numerical stability challenges specific to prepare-and-measure protocols, which were not addressed in previous works.
arXiv commentFinal PRX Quantum version which added more comparisons with entropic uncertainty relations. The code used to prepare the results in this paper is available at https://openqkdsecurity.wordpress.com/repositories-for-publications/
References in corpus (32)
- Quantum Key Distribution with High Loss: Toward Global Secure Communication
- Beating the PNS attack in practical quantum cryptography
- Security Aspects of Practical Quantum Cryptography
- Practical Decoy State for Quantum Key Distribution
- On quantum Renyi entropies: a new generalization and some properties
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- The Uncertainty Relation for Smooth Entropies
- Concise Security Bounds for Practical Decoy-State Quantum Key Distribution
- Post-selection technique for quantum channels with applications to quantum cryptography
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- Numerical approach for unstructured quantum key distribution
- Simple and tight device-independent security proofs
- Squashing Models for Optical Measurements in Quantum Communication
- Device-independent randomness expansion against quantum side information
- On the Dispersions of Three Network Information Theory Problems
- Reliable numerical key rates for quantum key distribution
- Entropy accumulation
- Asymptotic security analysis of discrete-modulated continuous-variable quantum key distribution
- Symmetries in Quantum Key Distribution and the Connection between Optimal Attacks and Optimal Cloning
- Efficiency of coherent state quantum cryptography in the presence of loss: Influence of realistic error correction
- Entropy accumulation with improved second-order term
- Squashing model for detectors and applications to quantum key distribution protocols
- Security of quantum key distribution from generalised entropy accumulation
- Security proof of practical quantum key distribution with detection-efficiency mismatch
- Fundamental Finite Key Limits for One-Way Information Reconciliation in Quantum Key Distribution
- Generalised entropy accumulation
- Security of discrete-modulated continuous-variable quantum key distribution
- Postselection technique for optical Quantum Key Distribution with improved de Finetti reductions
- Security Proof for Variable-Length Quantum Key Distribution
- Imperfect Phase-Randomisation and Generalised Decoy-State Quantum Key Distribution
- Improving key rates of the unbalanced phase-encoded BB84 protocol using the flag-state squashing model
- Improved Decoy-state and Flag-state Squashing Methods
Cited by in corpus (5)
- A consolidated and accessible security proof for finite-size decoy-state quantum key distribution
- Imperfect detectors for adversarial tasks with applications to quantum key distribution
- Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
- Sequential Semi-Device-Independent Quantum Randomness Certification
- Finite-size secret-key rates of discrete modulation continuous-variable quantum key distribution under Gaussian attacks