2004/12/31 by Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu · 1 citation
Computer Science · Physics and Astronomy · #BB84 #Chaos-based Image/Signal Encryption #Computer network #Computer science #Computer security #Cryptographic protocol #Cryptography #Encryption #Key (lock) #Physics #Protocol (science) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum cryptography #Secure communication #quant-ph
paper · pdf · doi:10.1142/s0219749906002316
published as International Journal of Quantum Information, vol. 4, no. 6, pp. 935-946, Dec. 2006 · 26 pages, 1 figure, version 2 fills a logical gap in the proof. Version 3 includes an upper bound on the mutual information with finete code length by using the decoding error probability of the code. Version 4 adds a paragraph clarifying that no previous paper has proved that the BB84 with random privacy amplification can tolerate the 11% error rate
arxiv created 2005/06/24 · openalex publication_date 2006/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
This paper shows that the random privacy amplification is secure with a higher key rate than Mayers' evaluation at the same error rate in the BB84 protocol with one-way or two-way classical communications. There exists only Mayers' evaluation on the secure key rate with random privacy amplification that is applicable to the BB84 protocol with two-way classical communications. Our result improves the secure key rate of the random privacy amplification in the BB84 protocol with two-way classical communications.