Information-theoretic security proof for quantum-key-distribution protocols

Renato Renner, Nicolas Gisin, Barbara Kraus

Research output: Contribution to journalArticlepeer-review

377 Scopus citations

Abstract

We present a 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 bounds on the secret-key rate which only involve entropies of two-qubit density operators and which are thus easy to compute. As an illustration of our results, we analyze the Bennett-Brassard 1984, the six-state, and the Bennett 1992 protocols with one-way error correction and privacy amplification. Surprisingly, the performance of these protocols is increased if one of the parties adds noise to the measurement data before the error correction. In particular, this additional noise makes the protocols more robust against noise in the quantum channel.

Original languageEnglish
Article number012332
JournalPhysical Review A
Volume72
Issue number1
DOIs
StatePublished - Jul 2005
Externally publishedYes

Fingerprint

Dive into the research topics of 'Information-theoretic security proof for quantum-key-distribution protocols'. Together they form a unique fingerprint.

Cite this