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

Numerical analysis of decoy state quantum key distribution protocols

Patrick R. Rice, Jim Harrington

Published Dec 30, 2008• 23 citations
arXivHTMLPDF

Abstract

Decoy state protocols are a useful tool for many quantum key distribution systems implemented with weak coherent pulses, allowing significantly better secret bit rates and longer maximum distances. In this paper we present a method to numerically find optimal three-level protocols, and we examine how the secret bit rate and the optimized parameters are dependent on various system properties, such as session length, transmission loss, and visibility. Additionally, we show how to modify the decoy state analysis to handle partially distinguishable decoy states as well as uncertainty in the prepared intensities.

DOI
10.48550/arxiv.0901.0013

Related papers

Secure Communication with One Decoy State and Two Way Quantum Key Distribution Scheme

Mohd Fared Abdul Khir, Iskandar Bahari, M. N. Mohd Zain +1 more

Quantum Key Distribution (QKD) provides a mean for unconditionally secure secret key sharing for secure communication. For a practical QKD system, the recently proposed decoy state protocol has become an essential tool. In this work, we conduct numerical analysis against several bounds for one decoy state with two way QKD protocol and compare their performance in terms of key rate and maximum secure distance.

•Jan 1, 2013•1 citation

Practical Quantum Key Distribution

Sellami Ali

We have presented a method to estimate parameters of the decoy state protocol based on one decoy state protocol for both BB84 and SARG04. This method can give different lower bound of the fraction of single-photon counts (y1), the fraction of two-photon counts (y2), the upper bound QBER of single-photon pulses (e1), the upper bound QBER of two-photon pulses (e2), and the lower bound of key generation rate for both BB84 and SARG04. The effects of statistical fluctuations on some parameters of our QKD system have been presented. We have also performed the optimization on the choice of intensities and percentages of signal state and decoy states which give out the maximum distance and the optimization of the key generation rate. The numerical simulation has shown that the fiber based QKD and free space QKD systems using the proposed method for BB84 are able to achieve both a higher secret key rate and greater secure distance than that of SARG04. Also, it is shown that bidirectional ground to satellite and inter-satellite communications are possible with our protocol. The experiment of decoy state QKD has been demonstrated using ID-3000 commercial QKD system based on a standard ‘Plug & Play’ set-up. One decoy state QKD has been implemented for both BB84 and SARG04 over different transmission distance of standard telecom fiber.

IGI Global eBooks•Oct 4, 2011•1 citation

Analysis of decoy state quantum-key-distribution system

Rongzhen Jiao, Zhang Wen-Han, 北京邮电大学理学院,北京 100876

The security of quantum-key-distribution system is analyzed using the decoy state protocol with two weak decoy states and one signal state. The comparison is based on the key generation rate as a function of distance for two types of decoy states: the vacuum and a weak decoy state, asymptotically approaching the theoretical limit of the most general type of decoy protocol, one-decoy-state protocol. We studied the two-decoy-state protocol in connection with the intensity of signal state, and the gain of signal states, the overall quantum bit error rate, the gain of single-photon states and the error rate of single-photon states and arrived at the optimal condition which maximizes the key generation rate.

Acta Physica Sinica•Jan 1, 2009•5 citations

Optimizing the decoy-state BB84 QKD protocol parameters

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

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.

arXiv:2006.15962•Quantum Information Processing•Apr 1, 2021•25 citations

Performance Analysis of Passive-Decoy State Quantum Key Distribution

Matteo Di Giancamillo, Alberto Gatto, Mario Martinelli +1 more

The passive decoy scheme represents a quantum key distribution protocol that employs a photon number resolving detector to selectively extract the decoy states from the signal states during post-processing. This selection process ensures resilience against attacks capable of distinguishing between these two states, thereby enhancing the security of the protocol. Previous research has emphasized the good performance of the protocol under optimal conditions. However, our study focuses on numerically evaluating the protocol performance in various practical scenarios. We aim to understand the implications of these scenarios in terms of the maximum attainable attenuation and bit rate per second, considering the number of photons per pulse sent under specific experimental conditions. Our findings demonstrate that opting for a low average photon number value ensures high tolerance to attenuation during communication, albeit at the cost of a reduced bit rate per second. Conversely, for lower attenuations, it is more advantageous to increase the average number of photons, even if it deviates from the ideal behaviour of a single-photon source. The benefit of selecting the decoy states at the end of the transmission remains consistent across different configurations. This research signifies an advancement in assessing the viability of incorporating the protocol within a practical QKD network.

International Conference on Transparent Optical Networks•Jul 2, 2023•0 citations

Finite-Key Analysis of 1-Decoy Method Quantum Key Distribution with Intensity Fluctuation

Chun Hua Zhou, Yu Zhi Zhou, Yang-Bin Xu +5 more

The decoy state quantum key distribution (QKD) protocol is proven to be an effective strategy against the photon number splitting attack. It was shown that the 1-decoy state protocol, easier to implement in the practical QKD system, outperforms the 2-decoy state protocol for block sizes of up to 108 bits. How intensity fluctuations influence the performance of the 1-decoy state protocol with finite resources remains a pending issue. In this paper, we present a finite-key analysis of the 1-decoy state protocol with intensity fluctuations and obtain the secret key rate formula about intensity fluctuations. Our numerical simulation results show that the stronger the intensity fluctuations, the lower the secret key rate for a small data block size of a few bits. Our research can provide theoretical implications for the selection of data size in the QKD system with intensity fluctuations.

Applied Sciences•May 7, 2022•1 citation
Decoy state protocols are a useful tool for many quantum key distribution systems implemented with weak coherent pulses, allowing significantly better secret bit rates and longer maximum distances. In this paper we present a method to numerically find optimal three-level protocols, and we examine how the secret bit rate and the optimized parameters are dependent on various system properties, such as session length, transmission loss, and visibility. Additionally, we show how to modify the decoy state analysis to handle partially distinguishable decoy states as well as uncertainty in the prepared intensities.
We have presented a method to estimate parameters of the decoy state protocol based on one decoy state protocol for both BB84 and SARG04. This method can give different lower bound of the fraction of single-photon counts (y1), the fraction of two-photon counts (y2), the upper bound QBER of single-photon pulses (e1), the upper bound QBER of two-photon pulses (e2), and the lower bound of key generation rate for both BB84 and SARG04. The effects of statistical fluctuations on some parameters of our QKD system have been presented. We have also performed the optimization on the choice of intensities and percentages of signal state and decoy states which give out the maximum distance and the optimization of the key generation rate. The numerical simulation has shown that the fiber based QKD and free space QKD systems using the proposed method for BB84 are able to achieve both a higher secret key rate and greater secure distance than that of SARG04. Also, it is shown that bidirectional ground to satellite and inter-satellite communications are possible with our protocol. The experiment of decoy state QKD has been demonstrated using ID-3000 commercial QKD system based on a standard ‘Plug & Play’ set-up. One decoy state QKD has been implemented for both BB84 and SARG04 over different transmission distance of standard telecom fiber.
The security of quantum-key-distribution system is analyzed using the decoy state protocol with two weak decoy states and one signal state. The comparison is based on the key generation rate as a function of distance for two types of decoy states: the vacuum and a weak decoy state, asymptotically approaching the theoretical limit of the most general type of decoy protocol, one-decoy-state protocol. We studied the two-decoy-state protocol in connection with the intensity of signal state, and the gain of signal states, the overall quantum bit error rate, the gain of single-photon states and the error rate of single-photon states and arrived at the optimal condition which maximizes the key generation rate.
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.
The passive decoy scheme represents a quantum key distribution protocol that employs a photon number resolving detector to selectively extract the decoy states from the signal states during post-processing. This selection process ensures resilience against attacks capable of distinguishing between these two states, thereby enhancing the security of the protocol. Previous research has emphasized the good performance of the protocol under optimal conditions. However, our study focuses on numerically evaluating the protocol performance in various practical scenarios. We aim to understand the implications of these scenarios in terms of the maximum attainable attenuation and bit rate per second, considering the number of photons per pulse sent under specific experimental conditions. Our findings demonstrate that opting for a low average photon number value ensures high tolerance to attenuation during communication, albeit at the cost of a reduced bit rate per second. Conversely, for lower attenuations, it is more advantageous to increase the average number of photons, even if it deviates from the ideal behaviour of a single-photon source. The benefit of selecting the decoy states at the end of the transmission remains consistent across different configurations. This research signifies an advancement in assessing the viability of incorporating the protocol within a practical QKD network.
The decoy state quantum key distribution (QKD) protocol is proven to be an effective strategy against the photon number splitting attack. It was shown that the 1-decoy state protocol, easier to implement in the practical QKD system, outperforms the 2-decoy state protocol for block sizes of up to 108 bits. How intensity fluctuations influence the performance of the 1-decoy state protocol with finite resources remains a pending issue. In this paper, we present a finite-key analysis of the 1-decoy state protocol with intensity fluctuations and obtain the secret key rate formula about intensity fluctuations. Our numerical simulation results show that the stronger the intensity fluctuations, the lower the secret key rate for a small data block size of a few bits. Our research can provide theoretical implications for the selection of data size in the QKD system with intensity fluctuations.