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

Scientific Reports

Quantum key distribution with prepare-and-measure Bell test

Yong-Gang Tan

Published Oct 13, 2016• 6 citations
Publisher

Abstract

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.

DOI
10.1038/srep35032

Related papers

Quantum Key Distribution Protocol with Enhanced Eavesdropper Detection Ability

Tamal Deb, Jyotsna Kumar Mandal, Deeptanu Sen

Quantum key distribution protocols printed a prominent mark in the old path of digital communication by making it even more secure. Unlike its classical counterpart, quantum key distribution protocols exploit the key principles of quantum elements, such as superposition and entanglement, to expose the intrusion in an efficient way. This paper presents a prepare and measure quantum key distribution protocol that detects the eavesdropper more efficiently by inflating bit mismatch between the sender and receiver. The proposed work achieves bit mismatch up to 62.5 percent while Eve is present in the quantum communication channel. The improvement is remarkable in comparison with the classical BB84 protocol, which has a bit mismatch up to 37.5 percent in presence of Eve.

Devices for Integrated Circuit (DevIC)•Apr 5, 2025•0 citations

Prepare-and-measure quantum key distribution from a bound on information leakage

Abhishek Mishra, Michele Masini, Maria Balanzó-Juandó +2 more

Every quantum key distribution (QKD) protocol must limit the information available outside the users' laboratories. In device-independent QKD this is essentially the only assumption made on the devices. In a prepare-and-measure setting it cannot be imposed strictly, since the sender's device must emit a signal that depends on her private input. The natural replacement, and a minimal one, is a leakage bound: a bound on how much information about the input leaves the sender's laboratory, through the intended signal or through any side channel. We ask how far this unavoidable requirement can replace a detailed model of the source. We show that this single bound, quantified by the probability of guessing the input from everything the source emits, suffices to prove security against collective attacks. In our analysis, nothing is assumed about the precise form of the emitted states, their dimension, energy or purity, nor about the receiver's measurement device, beyond the standard requirement that it does not leak Bob's data. The standard B92 and BB84 protocols do not certify any key under this minimal leakage bound assumption. But closely related protocols can and, in the ideal limit, achieve one secret bit per key round. For noisy implementations, we compute key rates using semidefinite programming relaxations. Our best protocols tolerate visibilities down to 0.84, corresponding to an 8% quantum bit error rate, compared with the 11% threshold of standard device-dependent BB84.

quant-pharXiv:2610.37296•Oct 28, 2026•0 citations

Quantum Cryptography with Weak Measurements

James E. Troupe, Jacob Farinholt

In this article we present a new prepare and measure quantum key distribution protocol that decouples the necessary quantum channel error estimation from its dependency on sifting, or otherwise post-selecting, the detection outcomes. Rather than estimating Eve's coupling to the quantum channel from the statistics of the sifted key, we infer this information from weak measurements made equally on all of the received photons immediately prior to post-selection by the photon detectors. We prove that the accuracy of the weak measurement parameter estimation is robust to reasonable device imperfections, even in an adversarial environment, and hence the asymptotic security of this protocol can be inferred from the security analysis of BB84. In addition to eliminating detector basis-dependent attacks, such as detector blinding, we demonstrate that this new prepared and measure QKD protocol is immune to a very powerful class of measurement-side device attacks that also allow an adversary control of the weak measurement outcomes given two modest requirements placed on the measurement-side devices. Finally, we compare the asymptotically achievable secure key rate of a decoy state version of the weak measurement protocol and show it is essentially equal to that of BB84 with decoy states and significantly higher than MDI-QKD for realistic system parameters.

arXiv:1702.04836•Feb 16, 2017•0 citations

A QKD Protocol Extendable to Support Entanglement and Reduce Unauthorized Information Gain by Randomizing the Bases Lists with Key Values and Invalidate Explicit Privacy Amplification

C. Sanjeevakumar, M. Kasi Rajan, L. Sudarsan +2 more

This paper suggests an improvement to the BB84 scheme in Quantum key distribution. The original scheme has its weakness in letting quantifiably more information gain to an eavesdropper during public announcement of unencrypted bases lists. The security of the secret key comes at the expense of the final key length. We aim at exploiting the randomness of preparation (measurement) basis and the bit values encoded (observed), so as to randomize the bases lists before they are communicated over the public channel. A proof of security is given for our scheme and proven that our protocol results in lesser information gain by Eve in comparison with BB84 and its other extensions. Moreover, an analysis is made on the feasibility of our proposal as such and to support entanglement based QKD. The performance of our protocol is compared in terms of the upper and lower bounds on the tolerable bit error rate. We also quantify the information gain (by Eve) mathematically using the familiar approach of the concept of Shannon entropy. The paper models the attack by Eve in terms of interference in a multi-access quantum channel. Besides, this paper also hints at the invalidation of a separate privacy amplification step in the "prepare-and-measure" protocols in general.

arXiv:quant-ph/0503024•Mar 2, 2005•1 citation

Quantum key distribution with dual detectors

Bing Qi, Yi Bing Zhao, Xiongfeng Ma +2 more

To improve the performance of a quantum-key-distribution (QKD) system, high speed, low dark count single photon detectors (or low-noise homodyne detectors) are required. However, in practice, a fast detector is usually noisy. Here, we propose a dual-detector method to improve the performance of a practical QKD system with realistic detectors: the legitimate receiver randomly uses either a fast (but noisy) detector or a quiet (but slow) detector to measure the incoming quantum signals. The measurement results from the quiet detector can be used to bound the eavesdropper's information, while the measurement results from the fast detector are used to generate a secure key. We apply this idea to various QKD protocols. Simulation results demonstrate significant improvements of the secure key rate in the lower loss regime in both Bennett-Brassard 1984 (BB84) protocol with ideal single photon source and Gaussian-modulated coherent states protocol; while for decoy-state BB84 protocol with weak coherent source, the improvement is moderate. We also discuss various practical issues in implementing the dual-detector scheme.

arXiv:quant-ph/0611044•Physical Review A•May 3, 2007•36 citations

Covert Communications-Based Information Reconciliation for Quantum Key Distribution Protocols

John Gariano, Ivan B. Djordjević

The rate at which a secure key can be generated in a quantum key distribution (QKD) protocol is limited by the channel loss and the quantum bit-error rate (QBER). Increases to the QBER can stem from detector noise, channel noise, or the presence of an eavesdropper, Eve. Eve is capable of obtaining information of the unsecure key by performing an attack on the quantum channel or by listening to all discussion performed via a noiseless public channel. Conventionally a QKD protocol will perform the information reconciliation over the authenticated public channel, revealing the parity bits used to correct for any quantum bit errors. In this invited paper, the possibility of limiting the information revealed to Eve during the information reconciliation is considered. Using a covert communication channel for the transmission of the parity bits, secure key rates are possible at much higher QBERs. This is demonstrated through the simulation of a polarization based QKD system implementing the BB84 protocol, showing significant improvement of the SKRs over the conventional QKD protocols.

International Conference on Transparent Optical Networks•Jul 1, 2019•2 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.
Quantum key distribution protocols printed a prominent mark in the old path of digital communication by making it even more secure. Unlike its classical counterpart, quantum key distribution protocols exploit the key principles of quantum elements, such as superposition and entanglement, to expose the intrusion in an efficient way. This paper presents a prepare and measure quantum key distribution protocol that detects the eavesdropper more efficiently by inflating bit mismatch between the sender and receiver. The proposed work achieves bit mismatch up to 62.5 percent while Eve is present in the quantum communication channel. The improvement is remarkable in comparison with the classical BB84 protocol, which has a bit mismatch up to 37.5 percent in presence of Eve.
Every quantum key distribution (QKD) protocol must limit the information available outside the users' laboratories. In device-independent QKD this is essentially the only assumption made on the devices. In a prepare-and-measure setting it cannot be imposed strictly, since the sender's device must emit a signal that depends on her private input. The natural replacement, and a minimal one, is a leakage bound: a bound on how much information about the input leaves the sender's laboratory, through the intended signal or through any side channel. We ask how far this unavoidable requirement can replace a detailed model of the source. We show that this single bound, quantified by the probability of guessing the input from everything the source emits, suffices to prove security against collective attacks. In our analysis, nothing is assumed about the precise form of the emitted states, their dimension, energy or purity, nor about the receiver's measurement device, beyond the standard requirement that it does not leak Bob's data. The standard B92 and BB84 protocols do not certify any key under this minimal leakage bound assumption. But closely related protocols can and, in the ideal limit, achieve one secret bit per key round. For noisy implementations, we compute key rates using semidefinite programming relaxations. Our best protocols tolerate visibilities down to 0.84, corresponding to an 8% quantum bit error rate, compared with the 11% threshold of standard device-dependent BB84.
In this article we present a new prepare and measure quantum key distribution protocol that decouples the necessary quantum channel error estimation from its dependency on sifting, or otherwise post-selecting, the detection outcomes. Rather than estimating Eve's coupling to the quantum channel from the statistics of the sifted key, we infer this information from weak measurements made equally on all of the received photons immediately prior to post-selection by the photon detectors. We prove that the accuracy of the weak measurement parameter estimation is robust to reasonable device imperfections, even in an adversarial environment, and hence the asymptotic security of this protocol can be inferred from the security analysis of BB84. In addition to eliminating detector basis-dependent attacks, such as detector blinding, we demonstrate that this new prepared and measure QKD protocol is immune to a very powerful class of measurement-side device attacks that also allow an adversary control of the weak measurement outcomes given two modest requirements placed on the measurement-side devices. Finally, we compare the asymptotically achievable secure key rate of a decoy state version of the weak measurement protocol and show it is essentially equal to that of BB84 with decoy states and significantly higher than MDI-QKD for realistic system parameters.
This paper suggests an improvement to the BB84 scheme in Quantum key distribution. The original scheme has its weakness in letting quantifiably more information gain to an eavesdropper during public announcement of unencrypted bases lists. The security of the secret key comes at the expense of the final key length. We aim at exploiting the randomness of preparation (measurement) basis and the bit values encoded (observed), so as to randomize the bases lists before they are communicated over the public channel. A proof of security is given for our scheme and proven that our protocol results in lesser information gain by Eve in comparison with BB84 and its other extensions. Moreover, an analysis is made on the feasibility of our proposal as such and to support entanglement based QKD. The performance of our protocol is compared in terms of the upper and lower bounds on the tolerable bit error rate. We also quantify the information gain (by Eve) mathematically using the familiar approach of the concept of Shannon entropy. The paper models the attack by Eve in terms of interference in a multi-access quantum channel. Besides, this paper also hints at the invalidation of a separate privacy amplification step in the "prepare-and-measure" protocols in general.
To improve the performance of a quantum-key-distribution (QKD) system, high speed, low dark count single photon detectors (or low-noise homodyne detectors) are required. However, in practice, a fast detector is usually noisy. Here, we propose a dual-detector method to improve the performance of a practical QKD system with realistic detectors: the legitimate receiver randomly uses either a fast (but noisy) detector or a quiet (but slow) detector to measure the incoming quantum signals. The measurement results from the quiet detector can be used to bound the eavesdropper's information, while the measurement results from the fast detector are used to generate a secure key. We apply this idea to various QKD protocols. Simulation results demonstrate significant improvements of the secure key rate in the lower loss regime in both Bennett-Brassard 1984 (BB84) protocol with ideal single photon source and Gaussian-modulated coherent states protocol; while for decoy-state BB84 protocol with weak coherent source, the improvement is moderate. We also discuss various practical issues in implementing the dual-detector scheme.
The rate at which a secure key can be generated in a quantum key distribution (QKD) protocol is limited by the channel loss and the quantum bit-error rate (QBER). Increases to the QBER can stem from detector noise, channel noise, or the presence of an eavesdropper, Eve. Eve is capable of obtaining information of the unsecure key by performing an attack on the quantum channel or by listening to all discussion performed via a noiseless public channel. Conventionally a QKD protocol will perform the information reconciliation over the authenticated public channel, revealing the parity bits used to correct for any quantum bit errors. In this invited paper, the possibility of limiting the information revealed to Eve during the information reconciliation is considered. Using a covert communication channel for the transmission of the parity bits, secure key rates are possible at much higher QBERs. This is demonstrated through the simulation of a polarization based QKD system implementing the BB84 protocol, showing significant improvement of the SKRs over the conventional QKD protocols.