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/0511175 · Journal of Cryptology

A Proof of the Security of Quantum Key Distribution

Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani Roychowdhury

Published Apr 11, 2006• 148 citations
arXivHTMLPDF
DOI
10.1007/s00145-005-0011-3

Related papers

Simple security proofs for continuous variable quantum key distribution with intensity fluctuating sources

Chenyang Li, Li Qian, Hoi‐Kwong Lo

Abstract Despite tremendous theoretical and experimental progress in continuous variable (CV) quantum key distribution (QKD), the security has not been rigorously established for most current continuous variable quantum key distribution systems that have imperfections. Among these imperfections, intensity fluctuation is one of the principal problems affecting security. In this paper, we provide simple security proofs for continuous variable quantum key distribution systems with intensity fluctuating sources. Specifically, depending on device assumptions in the source, the imperfect systems are divided into two general cases for security proofs. In the most conservative case, we prove the security based on the tagging idea, which is a main technique for the security proof of discrete variable quantum key distribution. Our proofs are simple to implement without any hardware adjustment for current continuous variable quantum key distribution systems. Also, we show that our proofs are able to provide secure secret keys in the finite-size scenario.

arXiv:1908.11423•npj Quantum Information•Oct 14, 2021•14 citations

Introduction of latest security proofs of quantum key distribution

Kiyoshi Tamaki

The Japan Society of Applied Physics•Feb 3, 2017•0 citations

Theory of the Security of Quantum Key Distribution

Kiyoshi Tamaki, Go Kato

NTT technical review•Sep 1, 2011•0 citations

Distributed Proof-of-Work with Quantum Key Distribution for Secure Computation

Jincheng Zhang

This paper proposes a novel approach to distributed consensus, termed "Distributed Proof-of-Work with Quantum Key Distribution (DPoW-QKD)," which addresses the limitations of traditional Proof-of-Work (PoW) systems. PoW's inherent energy consumption and susceptibility to attacks are well-documented. The core innovation lies in leveraging Quantum Key Distribution (QKD) to establish a secure channel for generating and validating PoW blocks. This eliminates the need for computationally intensive hashing algorithms, drastically reducing energy expenditure while simultaneously providing a robust defense against malicious actors. The system utilizes QKD to generate a shared secret key between participating nodes, which is then employed to securely generate and verify the PoW solution. The proposed mechanism significantly enhances security and efficiency, offering a pathway towards more sustainable and resilient distributed systems. Mathematical models and formal descriptions are provided to illustrate the key components and operational principles of DPoW-QKD. The performance of the system is analyzed considering factors like key distribution rate, block validation time, and overall network latency. This research presents a foundational framework for exploring QKD-enhanced distributed consensus protocols.

•Sep 2, 2026•0 citations

Quantum Key Distribution Algorithm Based on Probabilistic Topology Proof

Jincheng Zhang

Quantum Key Distribution (QKD) is a promising technology for secure communication, leveraging the principles of quantum mechanics to ensure the confidentiality of transmitted data. This paper explores the application of a probabilistic quantum key distribution (QKD) algorithm, employing a novel approach based on quantum entanglement and topology to provide a rigorous security proof. The core mechanism involves exploiting the inherent probabilistic nature of quantum systems to demonstrate the algorithm's resistance to eavesdropping. We provide a detailed mathematical framework and justification for the proposed proof, emphasizing the role of topology in shaping the security properties. This research aims to advance the understanding of QKD's security through a probabilistic framework, offering a distinct approach to guarantee secure key exchange.

•Sep 6, 2026•0 citations

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

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

Journal of Cryptology•Mar 3, 2004•558 citations
Abstract Despite tremendous theoretical and experimental progress in continuous variable (CV) quantum key distribution (QKD), the security has not been rigorously established for most current continuous variable quantum key distribution systems that have imperfections. Among these imperfections, intensity fluctuation is one of the principal problems affecting security. In this paper, we provide simple security proofs for continuous variable quantum key distribution systems with intensity fluctuating sources. Specifically, depending on device assumptions in the source, the imperfect systems are divided into two general cases for security proofs. In the most conservative case, we prove the security based on the tagging idea, which is a main technique for the security proof of discrete variable quantum key distribution. Our proofs are simple to implement without any hardware adjustment for current continuous variable quantum key distribution systems. Also, we show that our proofs are able to provide secure secret keys in the finite-size scenario.
This paper proposes a novel approach to distributed consensus, termed "Distributed Proof-of-Work with Quantum Key Distribution (DPoW-QKD)," which addresses the limitations of traditional Proof-of-Work (PoW) systems. PoW's inherent energy consumption and susceptibility to attacks are well-documented. The core innovation lies in leveraging Quantum Key Distribution (QKD) to establish a secure channel for generating and validating PoW blocks. This eliminates the need for computationally intensive hashing algorithms, drastically reducing energy expenditure while simultaneously providing a robust defense against malicious actors. The system utilizes QKD to generate a shared secret key between participating nodes, which is then employed to securely generate and verify the PoW solution. The proposed mechanism significantly enhances security and efficiency, offering a pathway towards more sustainable and resilient distributed systems. Mathematical models and formal descriptions are provided to illustrate the key components and operational principles of DPoW-QKD. The performance of the system is analyzed considering factors like key distribution rate, block validation time, and overall network latency. This research presents a foundational framework for exploring QKD-enhanced distributed consensus protocols.
Quantum Key Distribution (QKD) is a promising technology for secure communication, leveraging the principles of quantum mechanics to ensure the confidentiality of transmitted data. This paper explores the application of a probabilistic quantum key distribution (QKD) algorithm, employing a novel approach based on quantum entanglement and topology to provide a rigorous security proof. The core mechanism involves exploiting the inherent probabilistic nature of quantum systems to demonstrate the algorithm's resistance to eavesdropping. We provide a detailed mathematical framework and justification for the proposed proof, emphasizing the role of topology in shaping the security properties. This research aims to advance the understanding of QKD's security through a probabilistic framework, offering a distinct approach to guarantee secure key exchange.