Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way postprocessing.

By Valerio Scarani, Renato Renner. Physical Review Letters, 2007

305 citations recorded by the source corpus.

We derive a bound for the security of quantum key distribution with finite resources under one-way postprocessing, 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 such as Bennett-Brassard 1984 and six-states protocol. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N approximately 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.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/a8d83ad044e8dd926a767fc2c1a8871a65fe86dc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Xiongfeng Ma
  2. Hoi-Kwong Lo
  3. Jian-Wei Pan
  4. Feihu Xu
  5. Qiang Zhang
  6. Momtchil Peev
  7. Nicolas J. Cerf
  8. Miloslav Dusek

In Atomic and Molecular Physics, and Optics

  1. Xiongfeng Ma
  2. Hoi-Kwong Lo
  3. Jian-Wei Pan
  4. Feihu Xu
  5. Qiang Zhang
  6. Momtchil Peev
  7. Nicolas J. Cerf
  8. Miloslav Dusek

Citations in the corpus