Guessing probability in quantum key distribution

Abstract

On the basis of the existing trace distance result, we present a simple and efficient method to tighten the upper bound of the guessing probability. The guessing probability of the final key k can be upper bounded by the guessing probability of another key k', if k' can be mapped from the final key k. Compared with the known methods, our result is more tightened by thousands of orders of magnitude. For example, given a 10^{-9}-secure key from the sifted key, the upper bound of the guessing probability obtained using our method is 2*10^(-3277). This value is smaller than the existing result 10^(-9) by more than 3000 orders of magnitude. Our result shows that from the perspective of guessing probability, the performance of the existing trace distance security is actually much better than what was assumed in the past.

arXiv commentpublished version (with typing error corrected)

References in corpus (7)

• Tight Finite-Key Analysis for Quantum Cryptography
• Finite-key analysis for measurement-device-independent quantum key distribution
• Locking of accessible information and implications for the security of quantum cryptography
• Composability in quantum cryptography
• Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths
• Cryptographic security of quantum key distribution
• Measuring Secrecy by the Probability of a Successful Guess

Cited by in corpus (3)

• Experimental quantum secure network with digital signatures and encryption
• Security analysis of quantum key distribution with small block length and its application to quantum space communications
• A simple relation of guessing probability in quantum key distribution