Sharp finite statistics for quantum key distribution
arXiv:2410.04095 · doi:10.1103/l735-x48g
Abstract
The performance of quantum key distribution (QKD) heavily depends on statistical inference. For a broad class of protocols, the central statistical task is a random sampling problem, customarily addressed using a hypergeometric tail bound due to Serfling. Here, we provide an alternative solution for this task of unprecedented tightness among QKD security analyses. As a by-product, confidence intervals for the average of nonidentical Bernoulli parameters follow too. These naturally fit in statistical analyses of decoy-state QKD and also outperform standard tools. Last, we show that, in a vast parameter regime, the use of tail bounds is not enforced because the cumulative mass function of the hypergeometric distribution is accurately computable. This sharply decreases the minimum block sizes necessary for QKD, and reveals the tightness of our analytical bounds when moderate-to-large blocks are considered.
22 pages, 3 figures
References in corpus (28)
- Decoy State Quantum Key Distribution
- Quantum Key Distribution with High Loss: Toward Global Secure Communication
- Secure quantum key distribution with realistic devices
- Beating the PNS attack in practical quantum cryptography
- Secure Quantum Key Distribution
- Entropic Uncertainty Relations and their Applications
- Tight Finite-Key Analysis for Quantum Cryptography
- The Uncertainty Relation for Smooth Entropies
- Progress in satellite quantum key distribution
- Finite-key analysis for measurement-device-independent quantum key distribution
- Concise Security Bounds for Practical Decoy-State Quantum Key Distribution
- Security in Quantum Cryptography
- Experimental Twin-Field Quantum Key Distribution Over 1000 km Fiber Distance
- Leftover Hashing Against Quantum Side Information
- Efficient decoy-state quantum key distribution with quantified security
- Improved key rate bounds for practical decoy-state quantum key distribution systems
- A largely self-contained and complete security proof for quantum key distribution
- Chain Rules for Smooth Min- and Max-Entropies
- Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths
- Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
- Concentration inequalities for sampling without replacement
- Tight finite-key security for twin-field quantum key distribution
- Security analysis of quantum key distribution with small block length and its application to quantum space communications
- Sine gating detector with simple filtering for low-noise infra-red single photon detection at room temperature
- Security bounds for efficient decoy-state quantum key distribution
- Self-testing with finite statistics enabling the certification of a quantum network link
- Secure quantum key distribution with a subset of malicious devices
- Concentration inequalities via zero bias couplings