Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0409078 · Lecture notes in computer science

The Universal Composable Security of Quantum Key Distribution

Michael Ben-Or, Michał Horodecki, Debbie Leung, Dominic Mayers, Jonathan Oppenheim

Published Jan 1, 2005• 225 citations
arXivHTMLPDF
DOI
10.1007/978-3-540-30576-7_21

Related papers

Composable security of unidimensional continuous-variable quantum key distribution

Qin Liao, Ying Guo, Cailang Xie +3 more

arXiv:1708.02013•Quantum Information Processing•Mar 29, 2018•25 citations

The Universal Composable Securityof Quantum Key Distribution

Michael Ben-Or, Michał Horodecki, Debbie Leung +2 more

Springer eBooks•Jan 1, 2005•1 citation

Practical continuous-variable quantum key distribution with composable security

Nitin Jain, Hou-Man Chin, Hossein Mani +10 more

Abstract A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis and key generation should cater to the number N of the distributed quantum states being finite in practice. Continuous-variable (CV) QKD based on coherent states, despite being a suitable candidate for integration in the telecom infrastructure, has so far been unable to demonstrate composability as existing proofs require a rather large N for successful key generation. Here we report a Gaussian-modulated coherent state CVQKD system that is able to overcome these challenges and can generate composable keys secure against collective attacks with N ≈ 2 × 10 8 coherent states. With this advance, possible due to improvements to the security proof and a fast, yet low-noise and highly stable system operation, CVQKD implementations take a significant step towards their discrete-variable counterparts in practicality, performance, and security.

arXiv:2110.09262•Nature Communications•Aug 12, 2022•154 citations

Security of Quantum Key Distribution

이충만

•Jan 1, 2018•0 citations

Using Hash-Based Signatures to Bootstrap Quantum Key Distribution

Sébastien Kunz-Jacques, Paul Jouguet

Quantum Key Distribution is a secret distribution technique that requires an authenticated channel. This channel is usually created on top of an un-authenticated communication medium using unconditionally secure Message Authentication Codes (MAC) and an initial common secret. We examine the consequences of replacing this MAC algorithm by a cryptographic hash-based signature algorithm, like the Lamport algorithm. We show that provided one-way functions exist, the Lamport algorithm or its variants can be instantiated in a secure way in the Universally Composable sense, and can therefore be plugged into any QKD protocol with a composable security proof in a secure manner. This association, while relying on short-term computational hardness assumptions, results in an increase of the practical security of QKD and eases its deployment.

arXiv:1109.2844•Sep 13, 2011•5 citations

Security of Quantum Key Distribution

Norbert Lütkenhaus

Bulletin of the American Physical Society•Mar 8, 2007•0 citations
Abstract A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis and key generation should cater to the number N of the distributed quantum states being finite in practice. Continuous-variable (CV) QKD based on coherent states, despite being a suitable candidate for integration in the telecom infrastructure, has so far been unable to demonstrate composability as existing proofs require a rather large N for successful key generation. Here we report a Gaussian-modulated coherent state CVQKD system that is able to overcome these challenges and can generate composable keys secure against collective attacks with N ≈ 2 × 10 8 coherent states. With this advance, possible due to improvements to the security proof and a fast, yet low-noise and highly stable system operation, CVQKD implementations take a significant step towards their discrete-variable counterparts in practicality, performance, and security.
Quantum Key Distribution is a secret distribution technique that requires an authenticated channel. This channel is usually created on top of an un-authenticated communication medium using unconditionally secure Message Authentication Codes (MAC) and an initial common secret. We examine the consequences of replacing this MAC algorithm by a cryptographic hash-based signature algorithm, like the Lamport algorithm. We show that provided one-way functions exist, the Lamport algorithm or its variants can be instantiated in a secure way in the Universally Composable sense, and can therefore be plugged into any QKD protocol with a composable security proof in a secure manner. This association, while relying on short-term computational hardness assumptions, results in an increase of the practical security of QKD and eases its deployment.