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:2006.15962 · Quantum Information Processing

Optimizing the decoy-state BB84 QKD protocol parameters

Thomas Attema, Joost Bosman, Niels M. P. Neumann

Published Apr 1, 2021• 22 citations
arXivHTMLPDF

Abstract

Abstract Quantum key distribution (QKD) protocols allow for information theoretically secure distribution of (classical) cryptographic key material. However, due to practical limitations the performance of QKD implementations is somewhat restricted. For this reason, it is crucial to find optimal protocol parameters, while guaranteeing information theoretic security. The performance of a QKD implementation is determined by the tightness of the underlying security analysis. In particular, the security analyses determines thekey-rate, i.e., the amount of cryptographic key material that can be distributed per time unit. Nowadays, the security analyses of various QKD protocols are well understood. It is known that optimal protocol parameters, such as the number of decoy states and their intensities, can be found by solving a nonlinear optimization problem. The complexity of this optimization problem is typically handled by making a number of heuristic assumptions. For instance, the number of decoy states is restricted to only one or two, with one of the decoy intensities set to a fixed value, and vacuum states are ignored as they are assumed to contribute only marginally to the secure key-rate. These assumptions simplify the optimization problem and reduce the size of search space significantly. However, they also cause the security analysis to be non-tight, and thereby result in sub-optimal performance. In this work, we follow a more rigorous approach using both linear and nonlinear programs describing the optimization problem. Our approach, focusing on the decoy-state BB84 protocol, allows heuristic assumptions to be omitted, and therefore results in a tighter security analysis with better protocol parameters. We show an improved performance for the decoy-state BB84 QKD protocol, demonstrating that the heuristic assumptions typically made are too restrictive. Moreover, our improved optimization frameworks shows that the complexity of the performance optimization problem can also be handled without making heuristic assumptions, even with limited computational resources available.

DOI
10.1007/s11128-021-03078-0

Related papers

Correlation-assisted decoy state QKD protocol with self-checking mechanism

Supriyo Banerjee, Biswajit Maiti, Banani Saha

Abstract Ideal quantum key distribution (QKD) protocols require perfect single photon sources, detectors, and lossless channels. However, the present technology cannot ensure all of the requirements. Among the variants of practical QKD schemes, decoy state QKD in its present form approaches nearly the theoretical security. In any decoy state method, a compromise is made between the security of the key distribution and the rate of key generation by optimizing the two major protocol parameters: the number of decoy states and their relative intensities, and the length of the data string as well. Use of more number of decoy states and higher range of intensities though improve security, their optimization becomes too complex. Therefore, from practical consideration, some restrictions are to be imposed on the choice of decoy states and their intensities. In addition, the treatment of correlations among the laser pulses in security analysis is not fully understood. Normally, lack of correlations or randomness among the signal states is considered to gain security, but, in a different approach, described in the proposed protocol, additional correlation is introduced to improve key generation rate without compromising security. To do that, a one-way function is shared among the legitimate users to provide a semi-random choice of bases depending on the outcome of the receiver’s detector. The initial communication is made through a set of bits with predefined bases and intensity distribution. Then, with the help of the positive outcome of the receiver’s detector, the basis set as well as the length of the bit string for subsequent communications are computed. This results in correlation among the bases and the relative intensities of the signal states and provides a self-checking mechanism to identify eavesdropping. The security analysis of the protocol provides a low error rate and a relatively high key generation rate.

•Mar 6, 2024•1 citation

Tight security bounds for decoy-state quantum key distribution

Hua-Lei Yin, Min-Gang Zhou, Jie Gu +3 more

The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol, which has been proved secure against general attacks in the finite-key regime. Thereinto, statistical fluctuation analysis methods are very important in dealing with finite-key effects, which directly affect secret key rate, secure transmission distance and most importantly, the security. There are two tasks of statistical fluctuation in decoy-state BB84 QKD. One is the deviation between expected value and observed value for a given expected value or observed value. The other is the deviation between phase error rate of computational basis and bit error rate of dual basis. Here, we provide the rigorous and optimal analytic formula to solve the above tasks, resulting to higher secret key rate and longer secure transmission distance. Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols.

arXiv:2002.06530•Scientific Reports•Aug 31, 2020•75 citations

Security Bounds for Efficient Decoy-State Quantum Key Distribution

Marco Lucamarini, J. F. Dynes, Bernd Fröhlich +2 more

Information-theoretical security of quantum key distribution (QKD) has been convincingly proven in recent years and remarkable experiments have shown the potential of QKD for real-world applications. Due to its unique capability of combining high key rate and security in a realistic finite-size scenario, the efficient version of the BB84 QKD protocol endowed with decoy states has been subject of intensive research. Its recent experimental implementation finally demonstrated a secure key rate beyond 1 Mb/s over a 50 km of optical fiber. However, the achieved rate holds under the restrictive assumption that the eavesdropper performs collective attacks. Here, we review the protocol and generalize its security. We exploit a map by Ahrens to rigorously upper bound the hypergeometric distribution resulting from a general eavesdropping. Despite the extended applicability of the new protocol, its key rate is only marginally smaller than its predecessor in all cases of practical interest.

arXiv:1503.07335•IEEE Journal of Selected Topics in Quantum Electronics•Jan 26, 2015•33 citations

Security of Decoy-State Quantum Key Distribution with Correlated Intensity Fluctuations

Xoel Sixto, Víctor Zapatero, Marcos Curty

One of the most prominent techniques to enhance the performance of practical quantum key distribution (QKD) systems with laser sources is the decoy-state method. Current decoy-state QKD setups operate at gigahertz repetition rates, a regime where memory effects in the modulators and electronics that control them create correlations between the intensities of the emitted pulses. This translates into information leakage about the selected intensities, which cripples a crucial premise of the decoy-state method, thus invalidating the use of standard security analyzes. To overcome this problem, a security proof that exploits the Cauchy-Schwarz constraint has been introduced recently. Its main drawback is, however, that the achievable key rate is significantly lower than that of the ideal scenario without intensity correlations. Here, we improve this security proof technique by combining it with a fine-grained decoy-state analysis, which can deliver a tight estimation of the relevant parameters that determine the secret key rate. This results in a notable performance enhancement, being now the attainable distance double that of previous analyzes for certain parameter regimes. Also, we show that when the probability density function of the intensity fluctuations, conditioned on the current and previous intensity choices, is known, our approach provides a key rate very similar to the ideal scenario, which highlights the importance of an accurate experimental characterization of the correlations.

arXiv:2206.06700•Physical Review Applied•Oct 27, 2022•27 citations

Improving Parameter Optimization in Decoy-State Quantum Key Distribution

Zijian Li, Kejin Wei

Quantum key distribution (QKD) enables two remote users to share a string of key bits with information-theoretical security. Parameter optimization is a crucial step in achieving optimal performance in practical QKD systems. In general, such optimization is implemented using a local search algorithm (LSA). However, LSAs inevitably fail to find out the optimal values when the searched key rate function is nonconvex or has a discontinuity of first-order derivatives and a narrow parameter search space. This paper proposes a genetic algorithm-based method to overcome the limitations of LSAs for QKD parameter optimization. We tested the proposed method with various types of common QKD protocols and found that it has very high parameter optimization performance for QKD with a time consumption comparable to that using a standard LSA. We expect our method to be a valuable optimization tool for quantum information processing tasks.

Quantum Engineering•Feb 4, 2022•42 citations

A rigorous and complete security proof of decoy-state BB84 quantum key distribution

Devashish Tupkary, Shlok Nahar, Amir Arqand +2 more

We present a rigorous and complete security proof of the decoy-state BB84 quantum key distribution (QKD) protocol. Our analysis aims to achieve a high standard of mathematical rigour and completeness, thereby providing the necessary foundation for certification and standardization efforts. Beyond establishing the security of a specific protocol, this work develops a general and modular framework that can be readily adapted to a broad class of QKD protocols, including both prepare-and-measure and entanglement-based variants. Our framework unifies all major ingredients required for the analysis of realistic QKD protocols, including the analysis of classical authentication and classical processing, source-replacement schemes, finite-size analysis, source maps, squashing maps, and decoy-state techniques. In doing so, this work consolidates a diverse range of techniques scattered across the QKD literature into a unified formalism, representing a general and rigorous treatment of QKD security. Finally, it outlines a clear path towards incorporating practical imperfections within the same framework, thereby laying the groundwork for addressing implementation security in future analysis.

quant-pharXiv:2601.18035•Jan 27, 2026•0 citations
Abstract Quantum key distribution (QKD) protocols allow for information theoretically secure distribution of (classical) cryptographic key material. However, due to practical limitations the performance of QKD implementations is somewhat restricted. For this reason, it is crucial to find optimal protocol parameters, while guaranteeing information theoretic security. The performance of a QKD implementation is determined by the tightness of the underlying security analysis. In particular, the security analyses determines thekey-rate, i.e., the amount of cryptographic key material that can be distributed per time unit. Nowadays, the security analyses of various QKD protocols are well understood. It is known that optimal protocol parameters, such as the number of decoy states and their intensities, can be found by solving a nonlinear optimization problem. The complexity of this optimization problem is typically handled by making a number of heuristic assumptions. For instance, the number of decoy states is restricted to only one or two, with one of the decoy intensities set to a fixed value, and vacuum states are ignored as they are assumed to contribute only marginally to the secure key-rate. These assumptions simplify the optimization problem and reduce the size of search space significantly. However, they also cause the security analysis to be non-tight, and thereby result in sub-optimal performance. In this work, we follow a more rigorous approach using both linear and nonlinear programs describing the optimization problem. Our approach, focusing on the decoy-state BB84 protocol, allows heuristic assumptions to be omitted, and therefore results in a tighter security analysis with better protocol parameters. We show an improved performance for the decoy-state BB84 QKD protocol, demonstrating that the heuristic assumptions typically made are too restrictive. Moreover, our improved optimization frameworks shows that the complexity of the performance optimization problem can also be handled without making heuristic assumptions, even with limited computational resources available.
Abstract Ideal quantum key distribution (QKD) protocols require perfect single photon sources, detectors, and lossless channels. However, the present technology cannot ensure all of the requirements. Among the variants of practical QKD schemes, decoy state QKD in its present form approaches nearly the theoretical security. In any decoy state method, a compromise is made between the security of the key distribution and the rate of key generation by optimizing the two major protocol parameters: the number of decoy states and their relative intensities, and the length of the data string as well. Use of more number of decoy states and higher range of intensities though improve security, their optimization becomes too complex. Therefore, from practical consideration, some restrictions are to be imposed on the choice of decoy states and their intensities. In addition, the treatment of correlations among the laser pulses in security analysis is not fully understood. Normally, lack of correlations or randomness among the signal states is considered to gain security, but, in a different approach, described in the proposed protocol, additional correlation is introduced to improve key generation rate without compromising security. To do that, a one-way function is shared among the legitimate users to provide a semi-random choice of bases depending on the outcome of the receiver’s detector. The initial communication is made through a set of bits with predefined bases and intensity distribution. Then, with the help of the positive outcome of the receiver’s detector, the basis set as well as the length of the bit string for subsequent communications are computed. This results in correlation among the bases and the relative intensities of the signal states and provides a self-checking mechanism to identify eavesdropping. The security analysis of the protocol provides a low error rate and a relatively high key generation rate.
The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol, which has been proved secure against general attacks in the finite-key regime. Thereinto, statistical fluctuation analysis methods are very important in dealing with finite-key effects, which directly affect secret key rate, secure transmission distance and most importantly, the security. There are two tasks of statistical fluctuation in decoy-state BB84 QKD. One is the deviation between expected value and observed value for a given expected value or observed value. The other is the deviation between phase error rate of computational basis and bit error rate of dual basis. Here, we provide the rigorous and optimal analytic formula to solve the above tasks, resulting to higher secret key rate and longer secure transmission distance. Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols.
Information-theoretical security of quantum key distribution (QKD) has been convincingly proven in recent years and remarkable experiments have shown the potential of QKD for real-world applications. Due to its unique capability of combining high key rate and security in a realistic finite-size scenario, the efficient version of the BB84 QKD protocol endowed with decoy states has been subject of intensive research. Its recent experimental implementation finally demonstrated a secure key rate beyond 1 Mb/s over a 50 km of optical fiber. However, the achieved rate holds under the restrictive assumption that the eavesdropper performs collective attacks. Here, we review the protocol and generalize its security. We exploit a map by Ahrens to rigorously upper bound the hypergeometric distribution resulting from a general eavesdropping. Despite the extended applicability of the new protocol, its key rate is only marginally smaller than its predecessor in all cases of practical interest.
One of the most prominent techniques to enhance the performance of practical quantum key distribution (QKD) systems with laser sources is the decoy-state method. Current decoy-state QKD setups operate at gigahertz repetition rates, a regime where memory effects in the modulators and electronics that control them create correlations between the intensities of the emitted pulses. This translates into information leakage about the selected intensities, which cripples a crucial premise of the decoy-state method, thus invalidating the use of standard security analyzes. To overcome this problem, a security proof that exploits the Cauchy-Schwarz constraint has been introduced recently. Its main drawback is, however, that the achievable key rate is significantly lower than that of the ideal scenario without intensity correlations. Here, we improve this security proof technique by combining it with a fine-grained decoy-state analysis, which can deliver a tight estimation of the relevant parameters that determine the secret key rate. This results in a notable performance enhancement, being now the attainable distance double that of previous analyzes for certain parameter regimes. Also, we show that when the probability density function of the intensity fluctuations, conditioned on the current and previous intensity choices, is known, our approach provides a key rate very similar to the ideal scenario, which highlights the importance of an accurate experimental characterization of the correlations.
Quantum key distribution (QKD) enables two remote users to share a string of key bits with information-theoretical security. Parameter optimization is a crucial step in achieving optimal performance in practical QKD systems. In general, such optimization is implemented using a local search algorithm (LSA). However, LSAs inevitably fail to find out the optimal values when the searched key rate function is nonconvex or has a discontinuity of first-order derivatives and a narrow parameter search space. This paper proposes a genetic algorithm-based method to overcome the limitations of LSAs for QKD parameter optimization. We tested the proposed method with various types of common QKD protocols and found that it has very high parameter optimization performance for QKD with a time consumption comparable to that using a standard LSA. We expect our method to be a valuable optimization tool for quantum information processing tasks.
We present a rigorous and complete security proof of the decoy-state BB84 quantum key distribution (QKD) protocol. Our analysis aims to achieve a high standard of mathematical rigour and completeness, thereby providing the necessary foundation for certification and standardization efforts. Beyond establishing the security of a specific protocol, this work develops a general and modular framework that can be readily adapted to a broad class of QKD protocols, including both prepare-and-measure and entanglement-based variants. Our framework unifies all major ingredients required for the analysis of realistic QKD protocols, including the analysis of classical authentication and classical processing, source-replacement schemes, finite-size analysis, source maps, squashing maps, and decoy-state techniques. In doing so, this work consolidates a diverse range of techniques scattered across the QKD literature into a unified formalism, representing a general and rigorous treatment of QKD security. Finally, it outlines a clear path towards incorporating practical imperfections within the same framework, thereby laying the groundwork for addressing implementation security in future analysis.