Year: 2006
Type: article
Abstract: Many papers have proven the security of quantum key distribution (QKD) systems 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 required, 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.
Source: Physical Review A
Author: Masahito Hayashi
Institutions: Japan Science and Technology Agency, The University of Tokyo
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1977495965