pith. sign in

arxiv: 1409.3525 · v1 · pith:WLFOMBNBnew · submitted 2014-09-11 · 🪐 quant-ph · cs.CR· cs.IT· math.IT

Cryptographic security of quantum key distribution

classification 🪐 quant-ph cs.CRcs.ITmath.IT
keywords securitycryptographiccomposeddistributionerrorsprotocolprotocolsquantum
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spanning-tree-packing protocol for conference key propagation in quantum networks

    quant-ph 2025-06 unverdicted novelty 7.0

    Spanning-tree packing yields an optimal protocol for conference key generation from pairwise QKD links in arbitrary quantum network topologies.

  2. Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs

    quant-ph 2026-02 unverdicted novelty 2.0

    Overview of recent analytical and numerical advances in security proofs for QKD protocols that incorporate device imperfections to bridge theory and practice.