اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficient decoy-state quantum key distribution with quantified security
131
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We analyse the finite-size security of the efficient Bennett-Brassard 1984 protocol implemented with decoy states and apply the results to a gigahertz-clocked quantum key distribution system. Despite the enhanced security level, the obtained secure key rates are the highest reported so far at all fibre distances.
قيم البحث
اقرأ أيضاً
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 Mbps over a 50 km 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.
Quantum cryptography or, more precisely, quantum key distribution (QKD), is one of the advanced areas in the field of quantum technologies. The confidentiality of keys distributed with the use of QKD protocols is guaranteed by the fundamental laws of
quantum mechanics. This paper is devoted to the decoy state method, a countermeasure against vulnerabilities caused by the use of coherent states of light for QKD protocols whose security is proved under the assumption of single-photon states. We give a formal security proof of the decoy state method against all possible attacks. We compare two widely known attacks on multiphoton pulses: photon-number splitting and beam splitting. Finally, we discuss the equivalence of polarization and phase coding.
Twin-Field quantum key distribution (TF-QKD) and its variants, e.g. Phase-Matching QKD, Sending-or-not-sending QKD, and No Phase Post-Selection TFQKD promise high key rates at long distance to beat the rate distance limit without a repeater. The secu
rity proof of these protocols are based on decoy-state method, which is usually performed by actively modulating a variable optical attenuator together with a random number generator in practical experiments, however, active-decoy schemes like this may lead to side channel and could open a security loophole. To enhance the source security of TF-QKD, in this paper, we propose passive-decoy based TF-QKD, in which we combine TF-QKD with the passive-decoy method. And we present a simulation comparing the key generation rate with that in active-decoy, the result shows our scheme performs as good as active decoy TF-QKD, and our scheme could reach satisfactory secret key rates with just a few photon detectors. This shows our work is meaningful in practice.
Quantum key distribution establishes a secret string of bits between two distant parties. Of concern in weak laser pulse schemes is the especially strong photon number splitting attack by an eavesdropper, but the decoy state method can detect this at
tack with current technology, yielding a high rate of secret bits. In this Letter, we develop rigorous security statements in the case of finite statistics with only a few decoy states, and we present the results of simulations of an experimental setup of a decoy state protocol that can be simply realized with current technology.
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 fin
d 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
