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

Enhancements to Prepare-and-Measure Based QKD Protocols

Peter Y. A. Ryan, Bruce Christianson

Published Jan 1, 2013• 8 citations
Publisher
DOI
10.1007/978-3-642-41717-7_14

Related papers

Enhancements to Prepare-and-Measure-Based QKD Protocols (Transcript of Discussion)

Peter Y. A. Ryan

Lecture notes in computer science•Jan 1, 2013•0 citations

Quantum key distribution with prepare-and-measure Bell test

Yong-Gang Tan

The prepare-and-measure quantum key distribution (QKD) has the merits of fast speed, high key generation rate, and easy implementation. However, the detector side channel attacks greatly undermine the security of the key bits. The eavesdropper, Eve, exploits the flaws of the detectors to obtain illegal information without violating quantum principles. It means that she can intervene in the communication without being detected. A prepare-and-measure Bell test protocol will be proposed. By randomly carrying out Bell test at the side of the information receiver, Bob, Eve's illegal information gain within the detector side channel attack can be well bounded. This protocol does not require any improvement on the detectors used in available prepare-and-measure QKD. Though we only illustrate its application in the BB84 protocol, it is applicable for any prepare-and-measure QKD.

Scientific Reports•Oct 13, 2016•6 citations

Recent Developments in Practical QKD

Ramona Wolf

Lecture notes in physics•Jan 1, 2021•0 citations

Enhancing Quantum Resistance: Entanglement Swapping in Quantum key distribution and blockchain infrastructure

Sakshi Singh, Avdhesh Gupta, Anu Chaudhary

Key negotiation plays an important role in ensuring secure communication channel, and establishes confidentiality between parties. Quantum Key Distribution (QKD) represents an advanced and highly secure method for distributing cryptographic keys between involved parties. Multiple QKD implementation possibilities have led to the upgrading of various QKD protocols. Quantum key distribution involves two types of protocols approaches prepare-and-measure and entanglement based, this paper focuses entanglement-based protocol. Prepare-and-measure protocols are vulnerable to certain attacks and have lower key generation rate as compared to entanglement based protocol. Entanglement is certified as a key element in the arena of quantum information processing, contributing in applications like quantum cryptography, quantum computation and quantum communication. Entanglement leads to the phenomenon known as entanglement swapping, entanglement swapping phenomenon involves parties getting entangled without interacting with each other. This research focuses on the advantages and the security provided by entanglement swapping in quantum key distribution. Blockchain also utilizes key distribution process with the involvement of classical cryptography. Classical cryptography blockchain are not quantum-resistant, blockchain with quantum computing infrastructure are more advance and secure. Implementing entanglement swapping in the infrastructure of blockchain can make the blockchain quantum-resistant to secure communication and transactions. Within this manuscript, we theoretically study the entanglement swapping of Bell states in quantum key distribution and propose an idea of blockchain with entanglement swapping to enhance quantum resistance. This study also explores the employing of entanglement swapping in cloud infrastructure.

Asian Conference on Intelligent Technologies (ACOIT)•Sep 6, 2024•1 citation

A Survey and Comparison of Some of the Most Prominent QKD Protocols

Rainu Nandal, Ashish Nandal, Kamaldeep Joshi +1 more

•Jan 1, 2021•7 citations

Finite-Size Analysis of Prepare-and-Measure and Decoy-State Quantum Key Distribution via Entropy Accumulation

Lars Kamin, Amir Arqand, Ian George +2 more

An important goal in quantum key distribution (QKD) is the task of providing a finite-size security proof without the assumption of collective attacks. For prepare-and-measure QKD, one approach for obtaining such proofs is the generalized entropy-accumulation theorem (GEAT) but thus far it has only been applied to study a small selection of protocols. In this work, we present techniques for applying the GEAT in finite-size analysis of generic prepare-and-measure protocols, with a focus on decoy-state protocols. In particular, we present an improved approach for computing entropy bounds for decoy-state protocols, which has the dual benefits of providing tighter bounds than previous approaches (even asymptotically) and being compatible with methods for computing min-trade-off functions in the GEAT. Furthermore, we develop methods to incorporate some improvements to the finite-size terms in the GEAT and implement techniques to automatically optimize the min-trade-off function. Our approach also addresses some numerical-stability challenges specific to prepare-and-measure protocols, which have not been addressed in previous works.

arXiv:2406.10198•PRX Quantum•Jun 3, 2025•20 citations
The prepare-and-measure quantum key distribution (QKD) has the merits of fast speed, high key generation rate, and easy implementation. However, the detector side channel attacks greatly undermine the security of the key bits. The eavesdropper, Eve, exploits the flaws of the detectors to obtain illegal information without violating quantum principles. It means that she can intervene in the communication without being detected. A prepare-and-measure Bell test protocol will be proposed. By randomly carrying out Bell test at the side of the information receiver, Bob, Eve's illegal information gain within the detector side channel attack can be well bounded. This protocol does not require any improvement on the detectors used in available prepare-and-measure QKD. Though we only illustrate its application in the BB84 protocol, it is applicable for any prepare-and-measure QKD.
Key negotiation plays an important role in ensuring secure communication channel, and establishes confidentiality between parties. Quantum Key Distribution (QKD) represents an advanced and highly secure method for distributing cryptographic keys between involved parties. Multiple QKD implementation possibilities have led to the upgrading of various QKD protocols. Quantum key distribution involves two types of protocols approaches prepare-and-measure and entanglement based, this paper focuses entanglement-based protocol. Prepare-and-measure protocols are vulnerable to certain attacks and have lower key generation rate as compared to entanglement based protocol. Entanglement is certified as a key element in the arena of quantum information processing, contributing in applications like quantum cryptography, quantum computation and quantum communication. Entanglement leads to the phenomenon known as entanglement swapping, entanglement swapping phenomenon involves parties getting entangled without interacting with each other. This research focuses on the advantages and the security provided by entanglement swapping in quantum key distribution. Blockchain also utilizes key distribution process with the involvement of classical cryptography. Classical cryptography blockchain are not quantum-resistant, blockchain with quantum computing infrastructure are more advance and secure. Implementing entanglement swapping in the infrastructure of blockchain can make the blockchain quantum-resistant to secure communication and transactions. Within this manuscript, we theoretically study the entanglement swapping of Bell states in quantum key distribution and propose an idea of blockchain with entanglement swapping to enhance quantum resistance. This study also explores the employing of entanglement swapping in cloud infrastructure.
An important goal in quantum key distribution (QKD) is the task of providing a finite-size security proof without the assumption of collective attacks. For prepare-and-measure QKD, one approach for obtaining such proofs is the generalized entropy-accumulation theorem (GEAT) but thus far it has only been applied to study a small selection of protocols. In this work, we present techniques for applying the GEAT in finite-size analysis of generic prepare-and-measure protocols, with a focus on decoy-state protocols. In particular, we present an improved approach for computing entropy bounds for decoy-state protocols, which has the dual benefits of providing tighter bounds than previous approaches (even asymptotically) and being compatible with methods for computing min-trade-off functions in the GEAT. Furthermore, we develop methods to incorporate some improvements to the finite-size terms in the GEAT and implement techniques to automatically optimize the min-trade-off function. Our approach also addresses some numerical-stability challenges specific to prepare-and-measure protocols, which have not been addressed in previous works.