Upper bounds of eavesdropper's performances in finite-length code with the decoy method

Upper bounds of eavesdropper’s performances in finite-length code with the decoy method

Masahito Hayashi

Phys. Rev. A 76, 012329 – Published 26 July 2007; Erratum Phys. Rev. A 79, 019901 (2009)

Abstract

Security formulas of quantum key distribution (QKD) with imperfect resources are obtained for finite-length code when the decoy method is applied. This analysis is useful for guaranteeing the security of implemented QKD systems. Our formulas take into account the effect of the vacuum state and dark counts in the detector. We compare the asymptotic key generation rate in the presence of dark counts to that without the presence of dark counts.

Received 1 March 2007

DOI:https://doi.org/10.1103/PhysRevA.76.012329

Erratum

Erratum: Upper bounds of eavesdropper’s performances in finite-length code with the decoy method [Phys. Rev. A 76, 012329 (2007)]

Masahito Hayashi

Phys. Rev. A 79, 019901 (2009)

Authors & Affiliations

Masahito Hayashi^*

ERATO-SORST Quantum Computation and Information Project, JST, 5-28-3, Hongo, Bunkyo-ku, Tokyo 113-0033, Japan

^*Electronic address: masahito@qci.jst.go.jp

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand

Issue

Vol. 76, Iss. 1 — July 2007

Reuse & Permissions

Access Options

Author publication services for translation and copyediting assistance advertisement

Physical Review A

covering atomic, molecular, and optical physics and quantum information