Metraipolis › archive › dc_dfc80b4e9785

Combining Error Verification and Privacy Amplification in Quantum Key Distribution — arXiv:2610.10702

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10702
License (as archived)
CC0-1.0
Archived
2026-10-09T06:36:35.042Z
SHA-256 of the archived text
e44df946412bc46ae653c3e578ed23b1eb73ac951475ac3f158612a8596d96c3
Stable URL of this page
https://metraipolis.com/documento/dc_dfc80b4e9785

How to cite

Combining Error Verification and Privacy Amplification in Quantum Key Distribution — arXiv:2610.10702 — arXiv (en), https://arxiv.org/abs/2610.10702 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dfc80b4e9785 (Metraipolis archive dc_dfc80b4e9785, sha256 e44df946412bc46ae653c3e578ed23b1eb73ac951475ac3f158612a8596d96c3)
BibTeX
@misc{dcdfc80b4e9785,
  title = {Combining Error Verification and Privacy Amplification in Quantum Key Distribution — arXiv:2610.10702},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10702},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dfc80b4e9785; sha256 e44df946412bc46ae653c3e578ed23b1eb73ac951475ac3f158612a8596d96c3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10702. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, announce and compare a fixed number of bits of its output for error-verification, and retain the remaining bits as the final output key. This reduces the complexity of classical postprocessing, the amount of classical communication, and the amount of randomness needed in the protocol. While this construction has appeared in the literature, a suitable mathematical justification is lacking. In this work, we show that the security of such protocols, under certain simple conditions, follows from a slightly modified notion of secrecy of the protocol without the final error-verification step. In particular, we show that for most entropy-based proofs, the combined protocol can be implemented with no change to the key rate, and a minor change to the security parameter.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.10702 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:58:46.693Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).