Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing

Abstract

We derive a bound for the security of QKD with finite resources under one-way post-processing, based on a definition of security that is composable and has an operational meaning. While our proof relies on the assumption of collective attacks, unconditional security follows immediately for standard protocols like Bennett-Brassard 1984 and six-states. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N\sim 10^5 signals are exchanged and processed. For any other discrete-variable protocol, unconditional security can be obtained using the exponential de Finetti theorem, but the additional overhead leads to very pessimistic estimates.

References in corpus (4)

• Distillation of secret key and entanglement from quantum states
• Upper bounds of eavesdropper's performances in finite-length code with decoy method
• Practical Evaluation of Security for Quantum Key Distribution
• Finite key analysis for symmetric attacks in quantum key distribution

Cited by in corpus (8)

• Ultra fast quantum key distribution over a 97 km installed telecom fiber with wavelength-division multiplexing clock synchronization
• Smooth Renyi Entropies and the Quantum Information Spectrum
• Proof-of-Concept of Real-World Quantum Key Distribution with Quantum Frames
• Tomography increases key rates of quantum-key-distribution protocols
• Experimental quantum key distribution based on a Bell test
• Optimal ratio between phase basis and bit basis in QKD
• A Study of Channel Estimation and Postprocessing in Quantum Key Distribution Protocols
• Security Bounds for Quantum Cryptography with Finite Resources