Security proof for quantum key recycling with noise

Research output: Contribution to journalArticleAcademic

12 Downloads (Pure)

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 Škorić 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] and 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.
Original languageEnglish
Pages (from-to)0913-0934
JournalQuantum Information & Computation
Volume19
Issue number11+12
DOIs
Publication statusPublished - 2019

Fingerprint

Quantum cryptography
Security Proof
Recycling
recycling
Quantum Key Distribution
Encoding
coding
Authentication
Cryptography
Quantum State
Qubit
Post-processing
Encryption
reuse
Reuse
High-dimensional
Trace

Keywords

  • Quantum Key Recycling
  • Quantum cryptogtraphy

Cite this

@article{e34ab84acb7f4a908db89f6abb2f4327,
title = "Security proof for quantum key recycling with noise",
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 Škorić 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] and 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.",
keywords = "Quantum Key Recycling, Quantum cryptogtraphy",
author = "Daan Leermakers and Boris Skoric",
year = "2019",
doi = "10.26421/QIC19.11-12",
language = "English",
volume = "19",
pages = "0913--0934",
journal = "Quantum Information & Computation",
issn = "1533-7146",
publisher = "Rinton Press Inc.",
number = "11+12",

}

Security proof for quantum key recycling with noise. / Leermakers, Daan; Skoric, Boris.

In: Quantum Information & Computation, Vol. 19, No. 11+12, 2019, p. 0913-0934.

Research output: Contribution to journalArticleAcademic

TY - JOUR

T1 - Security proof for quantum key recycling with noise

AU - Leermakers, Daan

AU - Skoric, Boris

PY - 2019

Y1 - 2019

N2 - 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 Škorić 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] and 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.

AB - 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 Škorić 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] and 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.

KW - Quantum Key Recycling

KW - Quantum cryptogtraphy

U2 - 10.26421/QIC19.11-12

DO - 10.26421/QIC19.11-12

M3 - Article

VL - 19

SP - 913

EP - 934

JO - Quantum Information & Computation

JF - Quantum Information & Computation

SN - 1533-7146

IS - 11+12

ER -