Noise Tolerance of the BB84 Protocol with Random Privacy Amplification
arXiv:quant-ph/0412070 · doi:10.1142/S0219749906002316
Abstract
We prove that BB84 protocol with random privacy amplification is secure with a higher key rate than Mayers' estimate with the same error rate. Consequently, the tolerable error rate of this protocol is increased from 7.5 % to 11 %. We also extend this method to the case of estimating error rates separately in each basis, which enables us to securely share a longer key.
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
References in corpus (7)
- An information-theoretic security proof for QKD protocols
- Quantum key distribution with 2-bit quantum codes
- On the Power of Quantum Memory
- Reliability of Calderbank-Shor-Steane Codes and Security of Quantum Key Distribution
- Lower bound for the quantum capacity of a discrete memoryless quantum channel
- Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes
- Quantum key distribution with asymmetric channel noise
Cited by in corpus (13)
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
- Efficient decoy-state quantum key distribution with quantified security
- Upper bounds of eavesdropper's performances in finite-length code with decoy method
- Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths
- Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
- Quantum multiparty key distribution protocol without use of entanglement
- Dual universality of hash functions and its applications to quantum cryptography
- Security bounds for efficient decoy-state quantum key distribution
- Key rate available from mismatched mesurements in the BB84 protocol and the uncertainty principle
- Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols
- Optimal ratio between phase basis and bit basis in QKD
- Optimum ratio between two bases in Bennett-Brassard 1984 protocol with second order analysis