Security proof for Quantum Key Recycling with noise

Daan Leermakers; Boris Skoric

Paper 2018/264

Security proof for Quantum Key Recycling with noise

Daan Leermakers and Boris Skoric

Abstract

Quantum Key Recycling aims to re-use the keys employed in quantum encryption and quantum authentication schemes. QKR protocols can achieve better round complexity than Quantum Key Distribution. We consider a QKR protocol that works with qubits, as opposed to high-dimensional qudits. A security proof was given by Fehr and Salvail [1] in the case where there is practically no noise. A high-rate scheme for the noisy case was proposed by Skoric and de Vries [2], based on eight-state encoding. However, a security proof was not given. In this paper we introduce a protocol modification to [2]. We provide a security proof. The modified protocol has high rate not only for 8-state encoding, but also 6-state and BB84 encoding. Our proof is based on a bound on the trace distance between the real quantum state of the system and a state in which the keys are completely secure. It turns out that the rate is higher than suggested by previous results. Asymptotically the rate equals the rate of Quantum Key Distribution with one-way postprocessing.

Note: Improved presentation of the main proof.

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: quantum cryptography quantum key recycling
Contact author(s): b skoric @ tue nl
History: 2019-05-09: last of 3 revisions; 2018-03-12: received; See all versions
Short URL: https://ia.cr/2018/264
License: CC BY

BibTeX

@misc{cryptoeprint:2018/264,
      author = {Daan Leermakers and Boris Skoric},
      title = {Security proof for Quantum Key Recycling with noise},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/264},
      year = {2018},
      url = {https://eprint.iacr.org/2018/264}
}