2004/10/31 by Xiang-Bin Wang, Xiang‐Bin Wang · 30 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Computer science #Computer security #Cryptography #Key (lock) #Key generation #Mathematics #Photon #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum cryptography #Quantum information #Quantum key distribution #Quantum mechanics #Quantum optics #Topology (electrical circuits) #Upper and lower bounds #quant-ph
paper · pdf · doi:10.1103/physrevlett.94.230503
published as Phys. Rev. Lett., 94, 230503 (2005) · So far this is the unique decoy-state protocol which really works efficiently in practice. Prior art results are commented in both main context and the Appendix
arxiv created 2005/01/24 · openalex publication_date 2005/06/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We propose an efficient method to verify the upper bound of the fraction of counts caused by multiphoton pulses in practical quantum key distribution using weak coherent light, given whatever type of Eve's action. The protocol simply uses two coherent states for the signal pulses and vacuum for the decoy pulse. Our verified upper bound is sufficiently tight for quantum key distribution with a very lossy channel, in both the asymptotic and nonasymptotic case. So far our protocol is the only decoy-state protocol that works efficiently for currently existing setups.