Finite-key security against coherent attacks in quantum key distribution
arXiv:1008.2596 · doi:10.1088/1367-2630/12/12/123019
Abstract
The work by Christandl, König and Renner [Phys. Rev. Lett. 102, 020504 (2009)] provides in particular the possibility of studying unconditional security in the finite-key regime for all discrete-variable protocols. We spell out this bound from their general formalism. Then we apply it to the study of a recently proposed protocol [Laing et al., Phys. Rev. A 82, 012304 (2010)]. This protocol is meaningful when the alignment of Alice's and Bob's reference frames is not monitored and may vary with time. In this scenario, the notion of asymptotic key rate has hardly any operational meaning, because if one waits too long time, the average correlations are smeared out and no security can be inferred. Therefore, finite-key analysis is necessary to find the maximal achievable secret key rate and the corresponding optimal number of signals.
9 pages, 4 figures
References in corpus (6)
- Finite-size analysis of continuous-variable quantum key distribution
- Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
- Post-selection technique for quantum channels with applications to quantum cryptography
- Efficient quantum key distribution secure against no-signalling eavesdroppers
- Upper bounds of eavesdropper's performances in finite-length code with decoy method
- Secure Key Rate of the BB84 Protocol using Finite Sample Bits