Source-linked AI summary
Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
Valerio Scarani, Renato Renner
TL;DR
Finite-resource QKD needs security bounds that remain composable and operationally meaningful. This paper derives such a bound for one-way post-processing, shows unconditional security for BB84 and six-state protocols under collective attacks, and estimates positive key rates from about 10^5 signals.
Problem
Most existing QKD security bounds assume infinitely long keys, while finite-resource schemes require composable security suitable for applications such as encryption.
Method
The paper derives a finite-resource security bound for discrete-variable QKD using entanglement-based qubit protocols, parameter estimation, and one-way error correction followed by privacy amplification.
Results
For single-qubit BB84 and six-state implementations, the secret key rate becomes positive when approximately N~10^5 signals are exchanged and processed.
Takeaways & Limitations
The bound gives unconditional security for BB84 and six-state protocols through specific symmetries, while other discrete-variable protocols require exponential de Finetti methods with very pessimistic estimates.
Takeaways & Limitations
The main security formula is derived under collective attacks; general unconditional security for other protocols requires an exponential de Finetti reduction with substantial overhead.
Abstract
from arXiv · showhide
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.