Curator's Take
AI Commentary
This article marks the first time a full QKD security proof—specifically for BB84 with finite‑key composability—has been mechanically verified in Coq, closing a long‑standing gap between elegant theory and rigorously checked implementation. By reconstructing the smooth‑entropy framework, entropic uncertainty relation and Quantum Leftover Hash Lemma from first principles, FVQKD not only uncovers hidden side conditions that escaped earlier pen‑and‑paper arguments but also provides reusable formal infrastructure for future quantum‑cryptographic protocols. The result gives industry and standards bodies a stronger assurance that the unconditional security promised by QKD rests on provably sound mathematics, though scaling the approach to more complex or device‑independent schemes will still require substantial effort.
— Mark Eatherly
Summary
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.