Security analysis of the decoy method with the Bennett–Brassard 1984 protocol for finite key lengths

2013/02/28 by Masahito Hayashi, Ryota Nakayama · 3 citations
Computer Science · Mathematics · Medicine · Physics and Astronomy · #Algorithm #Biology #Combinatorics #Computer science #Computer security #Cryptography #Decoy #Genetics #Key (lock) #Key generation #Mathematics #Medicine #Physics #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum key distribution #Quantum mechanics #Security parameter #Topology (electrical circuits) #quant-ph

paper · pdf · doi:10.1088/1367-2630/16/6/063009

published as New Journal of Physics, 16 063009 (2014)

arxiv created 2013/11/19 · openalex publication_date 2014/06/05 · arxiv updated 2014/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

This paper provides a formula for the sacrifice bit-length for privacy amplification with the Bennett–Brassard 1984 protocol for finite key lengths, when we employ the decoy method. Using the formula, we can guarantee the security parameter for a realizable quantum key distribution system. The key generation rates with finite key lengths are numerically evaluated. The proposed method improves the existing key generation rate even in the asymptotic setting.

Citations

• Beating the Photon-Number-Splitting Attack in Practical Quantum Cryptography
• Families of vortex solitons in periodic media
• New hash functions and their use in authentication and set equality
• NOISE TOLERANCE OF THE BB84 PROTOCOL WITH RANDOM PRIVACY AMPLIFICATION
• Long-term performance of the SwissQuantum quantum key distribution network in a field environment
• General theory for decoy-state quantum key distribution with an arbitrary number of intensities
• Decoy-state quantum key distribution with both source errors and statistical fluctuations
• Decoy State Quantum Key Distribution
• Quantum Key Distribution with High Loss: Toward Global Secure Communication
• Practical Decoy State for Quantum Key Distribution
• Channel Coding Rate in the Finite Blocklength Regime
• Dual Universality of Hash Functions and Its Applications to Quantum Cryptography
• Upper bounds of eavesdropper’s performances in finite-length code with the decoy method
• Tight finite-key analysis for quantum cryptography

Cited by

• Towards the standardization of quantum state verification using optimal strategies
• More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function
• Universally-composable finite-key analysis for efficient four-intensity decoy-state quantum key distribution