ETH Zürich » Computer Science » Theory » Cryptography

Quantum Cryptography

Research Highlights

  • Quantum cryptography – revisited. Quantum cryptography has been advocated as being provably secure based only that the laws of quantum mechanics are correct. It was shown in [AKMR07] that, contrary to the established security proofs in quantum cryptography, there are provably-secure key agreement schemes which can be broken. While a generated key is indeed provably secure, its security is potentially lost when it is used. This shows that the traditional security definition is too weak. The flaw is due to a locking property of the notion of accessible information in quantum physics: one additional (physical) bit of information can increase the accessible information by more than one bit. This problem was solved in [Ren05] where the right security definition for quantum key distribution is stated and a new framework for proving the security is proposed.

Publications Concerning This Topic

Robert Koenig, Renato Renner, Andor Bariska, and Ueli Maurer
Small Accessible Quantum Information Does Not Imply Security
Physical Review Letters, vol. 98, no. 140502, Apr 2007, Preliminary version available at http://arxiv.org/abs/quant-ph/0512021.
Available files: [ Abstract ] [ BibTeX ]
Renato Renner
Security of Quantum Key Distribution
PhD Thesis, {ETH Zurich}, 2005, Available at http://arxiv.org/abs/quant-ph/0512258.
Available files: [ Abstract ] [ BibTeX ]

© IACR | Springer | ACM | IEEE


Main Research Page