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

Lecture notes in computer science

A Formal Approach to Unconditional Security Proofs for Quantum Key Distribution

Takahiro Kubota, Yoshihiko Kakutani, Go Kato, Yasuhito Kawano

Published Jan 1, 2011• 2 citations
Publisher
DOI
10.1007/978-3-642-21341-0_17

Related papers

Recent progress on the unconditional security proof for quantum key distribution protocols

Masato Koashi

Conference on Lasers and Electro-Optics•Jan 1, 2005•0 citations

Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security

Hoi‐Kwong Lo, H. F. Chau, M. Ardehali

arXiv:quant-ph/0011056•Journal of Cryptology•Mar 3, 2004•591 citations

Quantum Key Distribution and String Oblivious Transfer in Noisy Channels

Dominic R ayers

We prove the unconditional security of a quantum key distribution (QKD) protocol on a noisy channel against the most general attack allowed by quantum physics. We use the fact that in a previous paper we have reduced the proof of the unconditionally security of this QKD protocol to a proof that a corresponding Quantum String Oblivious Transfer (String-QOT) protocol would be unconditionally secure against Bob if implemented on top of an unconditionally secure bit commitment schcmc. We prove a lemma that extends a security proof given by Yao for a (one bit) QOT protocol to this String-QOT protocol. This result and the reduction mentioned above implies the unconditional security of our QKD protocol despite our previous proof that unconditionally secure bit commitment schemes are impossible.

•Jan 1, 2002•17 citations

Unconditional Security of Single-Photon Differential Phase Shift Quantum Key Distribution

Kai Wen, Kiyoshi Tamaki, Y. Yamamoto

In this Letter, we prove the unconditional security of the single-photon differential phase shift quantum key distribution (DPS-QKD) protocol, based on the conversion to an equivalent entanglement-based protocol. We estimate the upper bound of the phase error rate from the bit error rate, and show that the DPS-QKD protocol can generate an unconditionally secure key when the bit error rate is not greater than 4.12%. This proof is the first step to the unconditional security proof of a coherent state DPS-QKD.

arXiv:0806.2684•Physical Review Letters•Oct 22, 2009•70 citations

FVQKD: A Formal Verification of Quantum Key Distribution Security in Rocq

Ruixuan Deng, Zhengfeng Ji, Jiayu Zhang +1 more

Quantum key distribution (QKD), whose security is derived from quantum mechanics rather than computational assumptions, is moving into standardization and commercial deployment. Yet its security guarantees rest on technically delicate proofs checked by hand. Formal verification closes this gap, establishing a two-factor assurance: unconditional security from physical principles, and machine-checked proofs against reasoning errors. We present FVQKD, a Rocq library for machine-checking QKD security proofs. Its first result is a complete, end-to-end machine-checked proof of composable, finite-key security for BB84. The mechanization reconstructs the complete proof infrastructure from first principles, including the smooth entropy framework, the entropic uncertainty relation, and the Quantum Leftover Hash Lemma. It uncovers necessary side conditions that the published argument leaves unstated, one of which reveals a missing proof branch, and it grounds the information-theoretic bound in a formal semantics of protocol execution, which the pen-and-paper analysis lacks. The proof is entirely admit-free, relying only on the Rocq kernel and standard foundational axioms. To our knowledge, this is the first end-to-end formal verification of a QKD security proof. Built on MathComp, MathComp-Analysis, and CoqQ, the development provides quantum-information infrastructure designed for reuse across broader QKD variants and quantum cryptography applications.

quant-pharXiv:2610.30645•Oct 23, 2026•0 citations

A Proof of the Security of Quantum Key Distribution

Eli Biham, Michel Boyer, P. Oscar Boykin +2 more

arXiv:quant-ph/0511175•Journal of Cryptology•Apr 11, 2006•243 citations
We prove the unconditional security of a quantum key distribution (QKD) protocol on a noisy channel against the most general attack allowed by quantum physics. We use the fact that in a previous paper we have reduced the proof of the unconditionally security of this QKD protocol to a proof that a corresponding Quantum String Oblivious Transfer (String-QOT) protocol would be unconditionally secure against Bob if implemented on top of an unconditionally secure bit commitment schcmc. We prove a lemma that extends a security proof given by Yao for a (one bit) QOT protocol to this String-QOT protocol. This result and the reduction mentioned above implies the unconditional security of our QKD protocol despite our previous proof that unconditionally secure bit commitment schemes are impossible.
In this Letter, we prove the unconditional security of the single-photon differential phase shift quantum key distribution (DPS-QKD) protocol, based on the conversion to an equivalent entanglement-based protocol. We estimate the upper bound of the phase error rate from the bit error rate, and show that the DPS-QKD protocol can generate an unconditionally secure key when the bit error rate is not greater than 4.12%. This proof is the first step to the unconditional security proof of a coherent state DPS-QKD.
Quantum key distribution (QKD), whose security is derived from quantum mechanics rather than computational assumptions, is moving into standardization and commercial deployment. Yet its security guarantees rest on technically delicate proofs checked by hand. Formal verification closes this gap, establishing a two-factor assurance: unconditional security from physical principles, and machine-checked proofs against reasoning errors. We present FVQKD, a Rocq library for machine-checking QKD security proofs. Its first result is a complete, end-to-end machine-checked proof of composable, finite-key security for BB84. The mechanization reconstructs the complete proof infrastructure from first principles, including the smooth entropy framework, the entropic uncertainty relation, and the Quantum Leftover Hash Lemma. It uncovers necessary side conditions that the published argument leaves unstated, one of which reveals a missing proof branch, and it grounds the information-theoretic bound in a formal semantics of protocol execution, which the pen-and-paper analysis lacks. The proof is entirely admit-free, relying only on the Rocq kernel and standard foundational axioms. To our knowledge, this is the first end-to-end formal verification of a QKD security proof. Built on MathComp, MathComp-Analysis, and CoqQ, the development provides quantum-information infrastructure designed for reuse across broader QKD variants and quantum cryptography applications.