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:1005.0272

Security of high speed quantum key distribution with finite detector dead time

Viacheslav Burenkov, Bing Qi, Ben Fortescue, Hoi‐Kwong Lo

Published May 3, 2010• 2 citations
arXivHTMLPDF

Abstract

The security of a high speed quantum key distribution system with finite detector dead time τ is analyzed. When the transmission rate becomes higher than the maximum count rate of the individual detectors (1/τ), security issues affect the algorithm for sifting bits. Analytical calculations and numerical simulations of the Bennett-Brassard BB84 protocol are performed. We study Rogers et al.'s protocol (introduced in "Detector dead-time effects and paralyzability in high-speed quantum key distribution," New J. Phys. 9 (2007) 319) in the presence of an active eavesdropper Eve who has the power to perform an intercept-resend attack. It is shown that Rogers et al.'s protocol is no longer secure. More specifically, Eve can induce a basis-dependent detection efficiency at the receiver's end. Modified key sifting schemes that are secure in the presence of dead time and an active eavesdropper are then introduced. We analyze and compare these secure sifting schemes for this active Eve scenario, and calculate and simulate their key generation rate. It is shown that the maximum key generation rate is 1/(2τ) for passive basis selection, and 1/τ for active basis selection. The security analysis for finite detector dead time is also extended to the decoy state BB84 protocol.

DOI
10.48550/arxiv.1005.0272

Related papers

Security of high speed quantum key distribution with finite detector dead time

Viacheslav Burenkov, Bing Qi, Ben Fortescue +1 more

The security of a high speed quantum key distribution system with finite detector dead time $\tau$ is analyzed. When the transmission rate becomes higher than the maximum count rate of the individual detectors ($1/\tau$), security issues affect the scheme for sifting bits. Analytical calculations and numerical simulations of the Bennett-Brassard BB84 protocol are performed. We study Rogers et al.'s scheme (further information is available in [D. J. Rogers, J. C. Bienfang, A. Nakassis, H. Xu, and C. W. Clark, New J. Phys.~{\bf 9}, 319 (2007)]) in the presence of an active eavesdropper Eve who has the power to perform an intercept-resend attack. It is shown that Rogers et al.'s scheme is no longer guaranteed to be secure. More specifically, Eve can induce a basis-dependent detection efficiency at the receiver's end. Modified key sifting schemes that are basis-independent and thus secure in the presence of dead time and an active eavesdropper are then introduced. We analyze and compare these secure sifting schemes for this active Eve scenario, and calculate and simulate their key generation rate. It is shown that the maximum key generation rate is $1/(2\tau)$ for passive basis selection, and $1/\tau$ for active basis selection. The security analysis for finite detector dead time is also extended to the decoy state BB84 protocol for one particular secure sifting scheme.

Quantum Information and Computation•Mar 1, 2014•4 citations

Security of high speed quantum key distribution with finite detector dead time

BurenkovViacheslav, Qi-bing, FortescueBen +1 more

The security of a high speed quantum key distribution system with finite detector dead time τ is analyzed. When the transmission rate becomes higher than the maximum count rate of the individual de...

Quantum Information and Computation•Mar 1, 2014•0 citations

Security Issues of Quantum Cryptographic Systems with Imperfect Detectors

Viacheslav Burenkov

The laws of quantum physics can be used to secure communications between two distant parties in a scheme called quantum key distribution (QKD), even against a technologically unlimited eavesdropper. While the theoretical security of QKD has been proved rigorously, current implementations of QKD are generally insecure. In particular, mathematical models of devices, such as detectors, do not accurately describe their real-life behaviour. Such seemingly insignificant discrepancies can compromise the security of the entire scheme, especially as novel detector technologies are being developed with little regard for potential vulnerabilities.In this thesis, we study how detector imperfections can impact the security of QKD and how to overcome such technological limitations. We first analyze the security of a high-speed QKD system with finite detector dead time tau. We show that the previously reported sifting approaches are not guaranteed to be secure in this regime. More specifically, Eve can induce a basis-dependent detection efficiency at the receiver's end. Modified key sifting schemes that are basis-independent, and thus secure in the presence of dead time and an active eavesdropper, are discussed and compared. It is shown that the maximum key generation rate is 1/(2tau) for passive basis selection, and 1/tau for active basis selection. The security analysis is also extended to the decoy state BB84 protocol.We then study a relatively new type of single-photon detector called the superconducting nanowire single-photon detector (SNSPD), and discover some unexpected behaviour. We report an afterpulsing effect present when the SNSPD is operated in the high bias current regime. In our standard set-up, the afterpulsing is most likely to occur at around 180 ns following a detection event, for both real counts and dark counts. We characterize the afterpulsing behaviour and speculate that it is not due to the SNSPD itself but rather the associated read-out circuit. We also report and examine a short-lived enhancement of detection efficiency during the recovery of the SNSPD, as well as a longer dead time than previously thought. These findings should be of interest not only to the QKD community but also researchers using SNSPDs in other applications.

•Jun 1, 2015•1 citation

Detector dead-time effects and paralyzability in high-speed quantum key distribution

Daniel J. Rogers, Joshua C. Bienfang, Anastase Nakassis +2 more

Recent advances in quantum key distribution (QKD) have given rise to systems that operate at transmission periods significantly shorter than the dead times of their component single-photon detectors. As systems continue to increase in transmission rate, security concerns associated with detector dead times can limit the production rate of sifted bits. We present a model of high-speed QKD in this limit that identifies an optimum transmission rate for a system with given link loss and detector response characteristics.

arXiv:0706.1449•New Journal of Physics•Sep 10, 2007•30 citations

Security analysis of orthogonal state attack on a high-speed quantum key distribution system

Jialei Su, Qingquan Peng, Jia-Lin Chen +6 more

High-speed quantum key distribution (QKD) systems have achieved repetition frequencies above gigahertz through advanced technologies and devices, laying an important foundation for the deployment of high-key-rate QKD system. Although these advanced systems may introduce potential loopholes, an eavesdropper Eve is challenging to exploit them by performing the intercept-resend attacks due to the limited time window under high repetition frequency. However, here, we propose a security analysis model of orthogonal state attacks that do not require intercept-resend operation on the key rate of a QKD system. Under this framework, we propose a muted attack and experimentally verify the feasibility of the attack using a 1 GHz single-photon avalanche detector (SPAD). By sending hundreds of photons each time, Eve can mute Bob’s SPADs to control the overall detection response of the QKD receiver, allowing her to learn nearly all the keys. Furthermore, we use this security model to simulate the overestimated key rates of the QKD system under orthogonal state attacks, including both the muted attack and the dead-time attack. This work theoretically and experimentally shows a timely case of the security vulnerability in the high-speed QKD system.

arXiv:2506.03718•npj Quantum Information•May 6, 2026•2 citations

Finite-key security analysis of the decoy-state BB84 QKD with passive measurement

Akihiro Mizutani, Shun Kawakami, Go Kato

The decoy-state Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passiveand active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.

quant-pharXiv:2511.21253•Quantum Science and Technology•Nov 27, 2025•2 citations
The security of a high speed quantum key distribution system with finite detector dead time τ is analyzed. When the transmission rate becomes higher than the maximum count rate of the individual detectors (1/τ), security issues affect the algorithm for sifting bits. Analytical calculations and numerical simulations of the Bennett-Brassard BB84 protocol are performed. We study Rogers et al.'s protocol (introduced in "Detector dead-time effects and paralyzability in high-speed quantum key distribution," New J. Phys. 9 (2007) 319) in the presence of an active eavesdropper Eve who has the power to perform an intercept-resend attack. It is shown that Rogers et al.'s protocol is no longer secure. More specifically, Eve can induce a basis-dependent detection efficiency at the receiver's end. Modified key sifting schemes that are secure in the presence of dead time and an active eavesdropper are then introduced. We analyze and compare these secure sifting schemes for this active Eve scenario, and calculate and simulate their key generation rate. It is shown that the maximum key generation rate is 1/(2τ) for passive basis selection, and 1/τ for active basis selection. The security analysis for finite detector dead time is also extended to the decoy state BB84 protocol.
The security of a high speed quantum key distribution system with finite detector dead time τ\tauτ is analyzed. When the transmission rate becomes higher than the maximum count rate of the individual detectors (1/τ1/\tau1/τ), security issues affect the scheme for sifting bits. Analytical calculations and numerical simulations of the Bennett-Brassard BB84 protocol are performed. We study Rogers et al.'s scheme (further information is available in [D. J. Rogers, J. C. Bienfang, A. Nakassis, H. Xu, and C. W. Clark, New J. Phys.~{\bf 9}, 319 (2007)]) in the presence of an active eavesdropper Eve who has the power to perform an intercept-resend attack. It is shown that Rogers et al.'s scheme is no longer guaranteed to be secure. More specifically, Eve can induce a basis-dependent detection efficiency at the receiver's end. Modified key sifting schemes that are basis-independent and thus secure in the presence of dead time and an active eavesdropper are then introduced. We analyze and compare these secure sifting schemes for this active Eve scenario, and calculate and simulate their key generation rate. It is shown that the maximum key generation rate is 1/(2τ)1/(2\tau)1/(2τ) for passive basis selection, and 1/τ1/\tau1/τ for active basis selection. The security analysis for finite detector dead time is also extended to the decoy state BB84 protocol for one particular secure sifting scheme.
The laws of quantum physics can be used to secure communications between two distant parties in a scheme called quantum key distribution (QKD), even against a technologically unlimited eavesdropper. While the theoretical security of QKD has been proved rigorously, current implementations of QKD are generally insecure. In particular, mathematical models of devices, such as detectors, do not accurately describe their real-life behaviour. Such seemingly insignificant discrepancies can compromise the security of the entire scheme, especially as novel detector technologies are being developed with little regard for potential vulnerabilities.In this thesis, we study how detector imperfections can impact the security of QKD and how to overcome such technological limitations. We first analyze the security of a high-speed QKD system with finite detector dead time tau. We show that the previously reported sifting approaches are not guaranteed to be secure in this regime. More specifically, Eve can induce a basis-dependent detection efficiency at the receiver's end. Modified key sifting schemes that are basis-independent, and thus secure in the presence of dead time and an active eavesdropper, are discussed and compared. It is shown that the maximum key generation rate is 1/(2tau) for passive basis selection, and 1/tau for active basis selection. The security analysis is also extended to the decoy state BB84 protocol.We then study a relatively new type of single-photon detector called the superconducting nanowire single-photon detector (SNSPD), and discover some unexpected behaviour. We report an afterpulsing effect present when the SNSPD is operated in the high bias current regime. In our standard set-up, the afterpulsing is most likely to occur at around 180 ns following a detection event, for both real counts and dark counts. We characterize the afterpulsing behaviour and speculate that it is not due to the SNSPD itself but rather the associated read-out circuit. We also report and examine a short-lived enhancement of detection efficiency during the recovery of the SNSPD, as well as a longer dead time than previously thought. These findings should be of interest not only to the QKD community but also researchers using SNSPDs in other applications.
Recent advances in quantum key distribution (QKD) have given rise to systems that operate at transmission periods significantly shorter than the dead times of their component single-photon detectors. As systems continue to increase in transmission rate, security concerns associated with detector dead times can limit the production rate of sifted bits. We present a model of high-speed QKD in this limit that identifies an optimum transmission rate for a system with given link loss and detector response characteristics.
High-speed quantum key distribution (QKD) systems have achieved repetition frequencies above gigahertz through advanced technologies and devices, laying an important foundation for the deployment of high-key-rate QKD system. Although these advanced systems may introduce potential loopholes, an eavesdropper Eve is challenging to exploit them by performing the intercept-resend attacks due to the limited time window under high repetition frequency. However, here, we propose a security analysis model of orthogonal state attacks that do not require intercept-resend operation on the key rate of a QKD system. Under this framework, we propose a muted attack and experimentally verify the feasibility of the attack using a 1 GHz single-photon avalanche detector (SPAD). By sending hundreds of photons each time, Eve can mute Bob’s SPADs to control the overall detection response of the QKD receiver, allowing her to learn nearly all the keys. Furthermore, we use this security model to simulate the overestimated key rates of the QKD system under orthogonal state attacks, including both the muted attack and the dead-time attack. This work theoretically and experimentally shows a timely case of the security vulnerability in the high-speed QKD system.
The decoy-state Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passiveand active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.