Leftover hashing from quantum error correction: Unifying the two approaches to the security proof of quantum key distribution
arXiv:1809.05479 · doi:10.1109/TIT.2020.2969656
Abstract
We show that the Mayers-Shor-Preskill approach and Renner's approach to proving the security of quantum key distribution (QKD) are essentially the same. We begin our analysis by considering a special case of QKD called privacy amplification (PA). PA itself is an important building block of cryptography, both classical and quantum. The standard theoretical tool used for its security proof is called the leftover hashing lemma (LHL). We present a direct connection between the LHL and the coding theorem of a certain quantum error correction code. Then we apply this result to proving the equivalence between the two approaches to proving the security of QKD.
arXiv comment20 pages, no figure. v2: Typos and minor technical errors corrected; presentation improved. v3: Comparison with the previous literature added, references added, and typos and minor technical errors corrected
References in corpus (26)
- Quantum cryptography: Public key distribution and coin tossing
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Field test of quantum key distribution in the Tokyo QKD Network
- Satellite-relayed intercontinental quantum network
- Distance measures to compare real and ideal quantum processes
- Tight Finite-Key Analysis for Quantum Cryptography
- Quantum random number generation
- Leftover Hashing Against Quantum Side Information
- Unconditionally Secure Key Distribution Based on Two Nonorthogonal States
- Trevisan's extractor in the presence of quantum side information
- Numerical approach for unstructured quantum key distribution
- 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
- Noisy channel coding via privacy amplification and information reconciliation
- Relating different quantum generalizations of the conditional Renyi entropy
- More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
- Unconditionally secure key distillation from multi-photons
- Physical Underpinnings of Privacy
- Privacy Amplification, Private States, and the Uncertainty Principle
- Dual universality of hash functions and its applications to quantum cryptography
- Sine distance for quantum states
- Duality of privacy amplification against quantum adversaries and data compression with quantum side information
- Lower bound on the relative error of mixed-state cloning and related operations
- Complementarity, distillable secret key, and distillable entanglement
- Improved Asymptotic Key Rate of the B92 Protocol
Cited by in corpus (9)
- Simple security analysis of phase-matching measurement-device-independent quantum key distribution
- Security framework for quantum key distribution with imperfect sources
- Finite-key analysis of loss-tolerant quantum key distribution based on random sampling theory
- Refined finite-size analysis of binary-modulation continuous-variable quantum key distribution
- Satellite-based communication for phase-matching measurement-device-independent quantum key distribution
- Phase error rate estimation in QKD with imperfect detectors
- Security loophole in error verification in quantum key distribution
- Security proofs for practical QKD: variations, techniques, gaps, and limitations
- Equivalence of three classical algorithms with quantum side information: Privacy amplification, error correction, and data compression