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.
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.
Due to its ability to tolerate high channel loss, decoy-state quantum key distribution (QKD) has been one of the main focuses within the QKD community. Notably, several experimental groups have demonstrated that it is secure and feasible under real-world conditions. Crucially, however, the security and feasibility claims made by most of these experiments were obtained under the assumption that the eavesdropper is restricted to particular types of attacks or that the finite-key effects are neglected. Unfortunately, such assumptions are not possible to guarantee in practice. In this work, we provide concise and tight finite-key security bounds for practical decoy-state QKD that are valid against general attacks.
Quantum key distribution (QKD) promises provably secure communications. In order to improve the secret key rate, combining a biased basis choice with the decoy-state method is proposed. Concomitantly, there is a basis-independent detection efficiency condition, which usually cannot be satisfied in a practical system, such as the time-phase encoding. Fortunately, this flaw has been recently removed theoretically and experimentally in the four-intensity decoy-state BB84 QKD protocol using the fact that the expected yields of single-photon states prepared in two bases stay the same for a given measurement basis. However, the security proofs do not fully consider the finite-key effects for general attacks. In this work, we provide the rigorous finite-key security bounds in the universally composable framework for the four-intensity decoy-state BB84 QKD protocol. We build a time-phase encoding system with 200 MHz clock to implement this protocol, in which the real-time secret key rate is more than 60 kbps over 50 km single-mode fiber.
The use of decoy states in quantum key distribution (QKD) has provided a method for substantially increasing the secret key rate and distance that can be covered by QKD protocols with practical signals. The security analysis of these schemes, however, leaves open the possibility that the development of better proof techniques or better classical postprocessing methods might further improve their performance in realistic scenarios. In this paper, we derive upper bounds on the secure key rate for decoy-state QKD. These bounds are based basically only on the classical correlations established by the legitimate users during the quantum communication phase of the protocol. The only assumption about the possible postprocessing methods is that double click events are randomly assigned to single click events. Further, we consider only secure key rates based on the uncalibrated device scenario which assigns imperfections such as detection inefficiency to the eavesdropper. Our analysis relies on two preconditions for secure two-way and one-way QKD. The legitimate users need to prove that there exists no separable state (in the case of two-way QKD) or that there exists no quantum state having a symmetric extension (one-way QKD) that is compatible with the available measurements results. Both criteria have been previously applied to evaluate single-photon implementations of QKD. Here we use them to investigate a realistic source of weak coherent pulses. The resulting upper bounds can be formulated as a convex optimization problem known as a semidefinite program which can be efficiently solved. For the standard four-state QKD protocol, they are quite close to known lower bounds, thus showing that there are clear limits to the further improvement of classical postprocessing techniques in decoy-state QKD.
Decoy-state quantum key distribution (QKD) has convincingly been shown the core solution to secure key exchange. While standard BB84 protocol needs to prepare and measure all states of two complementary bases, which seriously restricts its real life applications in photonic integration and high speed system. Fortunately, a simplified BB84, only sending and receiving three states, achieves the same asymptotic secret key rate compared with standard BB84 under coherent attacks. In this work, by skillfully exploiting uncertainty relation for smooth entropies, we provide the finite-key security bounds for decoy-state simplified BB84 QKD against coherent attacks in the universally composable framework. Simulation results show that it can also achieve almost the same performance compared with standard BB84 even the total number of pulses is as low as 108. We conclude that simplified BB84 can completely replace standard BB84 to be the best choice for QKD in most common practical scenarios.
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.
Secure quantum key distribution (QKD) promises a revolutionizing in optical applications such as encryption, and imaging. However, their implementation in real-world scenarios continues to be challenged. The goal of this work is to verify the presence of photon number splitting (PNS) attack in quantum cryptography system based on BB84 protocol and to obtain a maximum secure key length as possible. This was realized through randomly interleaving decoy states with mean photon numbers of 5.38, 1.588, and 0.48 between the signal states with mean photon numbers of 2.69, 0.794, and 0.24. Experiment results show that a maximum secure key length obtained from our system, which ignores eavesdropping cases, is 125 with 20% decoy states and 82 with 50% decoy states for mean photon number of 0.794 for signal states and 1.588 for decoy states.