Cryptographic security of quantum key distribution
Christopher Portmann, Renato Renner

TL;DR
This paper introduces the cryptographic security framework for Quantum Key Distribution (QKD), emphasizing composability and error analysis, and discusses operational interpretations of security metrics.
Contribution
It derives a security criterion for QKD within a composable framework and illustrates error accumulation in protocol composition.
Findings
Error in composed protocols sums the errors of individual protocols
Security criterion for QKD based on composable security notions
Operational interpretation of the security distance metric
Abstract
This work is intended as an introduction to cryptographic security and a motivation for the widely used Quantum Key Distribution (QKD) security definition. We review the notion of security necessary for a protocol to be usable in a larger cryptographic context, i.e., for it to remain secure when composed with other secure protocols. We then derive the corresponding security criterion for QKD. We provide several examples of QKD composed in sequence and parallel with different cryptographic schemes to illustrate how the error of a composed protocol is the sum of the errors of the individual protocols. We also discuss the operational interpretations of the distance metric used to quantify these errors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
