Practical Evaluation of Security for Quantum Key Distribution

Abstract

Many papers proved the security of quantum key distribution (QKD) system, in the asymptotic framework. The degree of the security has not been discussed in the finite coding-length framework, sufficiently. However, to guarantee any implemented QKD system requires, it is needed to evaluate a protocol with a finite coding-length. For this purpose, we derive a tight upper bound of the eavesdropper's information. This bound is better than existing bounds. We also obtain the exponential rate of the eavesdropper's information. Further, we approximate our bound by using the normal distribution.

The manuscript has been modfied

References in corpus (4)

• Quantum key distribution over 122 km of standard telecom fiber
• A Generic Security Proof for Quantum Key Distribution
• Simple security proof of quantum key distribution via uncertainty principle
• Information-Disturbance Theorem for Mutually Unbiased Observables

Cited by in corpus (5)

• Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
• Upper bounds of eavesdropper's performances in finite-length code with decoy method
• Tomography increases key rates of quantum-key-distribution protocols
• Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols
• Optimal ratio between phase basis and bit basis in QKD