Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution

Abstract

We consider an information reconciliation protocol for quantum key distribution (QKD). In order to correct down the error rate, we suggest a method, which is based on symmetric blind information reconciliation for the low-density parity-check (LDPC) codes. We develop a subsequent verification protocol with the use of $\epsilon$-universal hash functions, which allows verifying the identity between the keys with a certain probability.

4 pages; 1 figure; published version

References in corpus (3)

• Practical challenges in quantum key distribution
• Symmetric blind information reconciliation for quantum key distribution
• Improved construction of irregular progressive edge-growth Tanner graphs

Cited by in corpus (10)

• Security of the decoy state method for quantum key distribution
• Security of quantum key distribution with detection-efficiency mismatch in the single-photon case: Tight bounds
• Preparing a commercial quantum key distribution system for certification against implementation loopholes
• Security of quantum key distribution with detection-efficiency mismatch in the multiphoton case
• Error estimation at the information reconciliation stage of quantum key distribution
• Modular quantum key distribution setup for research and development applications
• Eurasian-Scale Experimental Satellite-based Quantum Key Distribution with Detector Efficiency Mismatch Analysis
• Blind information reconciliation with polar codes for quantum key distribution
• Optimizing the deployment of quantum key distribution switch-based networks
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together