An information-theoretic security proof for QKD protocols

  title={An information-theoretic security proof for QKD protocols},
  author={Renato Renner and Nicolas Gisin and Barbara Kraus},
  journal={Physical Review A},
We present a new technique for proving the security of quantum key distribution (QKD) protocols. It is based on direct information-theoretic arguments and thus also applies if no equivalent entanglement purification scheme can be found. Using this technique, we investigate a general class of QKD protocols with one-way classical post-processing. We show that, in order to analyze the full security of these protocols, it suffices to consider collective attacks. Indeed, we give new lower and upper… 

Figures from this paper

Security of a semi-quantum protocol where reflections contribute to the secret key
In this work, a complete proof of security is provided by deriving a lower bound of the protocol’s key rate in the asymptotic scenario and finding an error threshold value such that for all error rates less than this threshold, it is guaranteed that A and B may distill a secure secret key.
Security Bounds for Quantum Cryptography with Finite Resources
This work analyzes the security of QKD under the realistic assumption that the amount of communication is finite, and presents the bounds with finite resources for "device-independent security" against collective attacks.
Optimal attacks on qubit-based Quantum Key Recycling
From the optimal attacks determined, the required amount of privacy amplification is computed and hence the achievable communication rate (useful information per qubit) of qubit-based QKR, and 8-state encoding yields the highest communication rates.
Asymptotic security analysis of teleportation-based quantum cryptography
We prove that the teleportation-based quantum cryptography protocol presented in Gordon and Rigolin (Opt Commun 283:184, 2010), which is built using only orthogonal states encoding the classical bits
Quantum key distribution with delayed privacy amplification and its application to the security proof of a two-way deterministic protocol
This paper considers delaying PA of the final key after its use in one-time pad encryption and proves its security, and uses it to prove the security of a qubit-based two-way deterministic QKD protocol which uses four states and four encoding operations.
Semiquantum key distribution with high quantum noise tolerance
A new semi-quantum key distribution (SQKD) protocol is constructed which actually takes advantage of this necessary two-way channel, and it is shown it is able to tolerate a channel noise level higher than any prior SQKD protocol to-date.
Security Bounds for Efficient Decoy-State Quantum Key Distribution
The protocol is reviewed and a map by Ahrens is exploited to rigorously upper bound the hypergeometric distribution resulting from a general eavesdropping, which is only marginally smaller than its predecessor in all cases of practical interest.
Upper bounds for the secure key rate of the decoy-state quantum key distribution
Upper bounds on the secure key rate for decoy state QKD are derived, showing that there are clear limits to the further improvement of classical post-processing techniques in decoystate QKKD.
Full Security of Quantum Key Distribution From No-Signaling Constraints
We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers,
Security proof for round-robin differential phase shift QKD
We give a security proof of the ‘round-robin differential phase shift’ (RRDPS) quantum key distribution scheme, and we give a tight bound on the required amount of privacy amplification. Our proof