Efficient reconciliation protocol for discrete-variable quantum key distribution
arXiv:0901.2140 · doi:10.1109/ISIT.2009.5205475
Abstract
Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the BSC. In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.
References in corpus (4)
- Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
- Multidimensional reconciliation for continuous-variable quantum key distribution
- Low Cost and Compact Quantum Cryptography
- Tomography increases key rates of quantum-key-distribution protocols
Cited by in corpus (22)
- Quantum Communication Using Semiconductor Quantum Dots
- Satellite-Based Continuous-Variable Quantum Communications: State-of-the-Art and a Predictive Outlook
- A largely self-contained and complete security proof for quantum key distribution
- Experimental quantum conference key agreement
- Passively stable distribution of polarisation entanglement over 192 km of deployed optical fibre
- An Experimental Implementation of Oblivious Transfer in the Noisy Storage Model
- Rate Compatible Protocol for Information Reconciliation: An application to QKD
- Quantum Communication Uplink to a 3U CubeSat: Feasibility & Design
- Post-processing procedure for industrial quantum key distribution systems
- Novel High-Speed Polarization Source for Decoy-State BB84 Quantum Key Distribution over Free Space and Satellite Links
- Secret Sharing LDPC Codes for the BPSK-constrained Gaussian Wiretap Channel
- Finite key performance of satellite quantum key distribution under practical constraints
- A real-time design based on FPGA for Expeditious Error Reconciliation in QKD system
- Improved construction of irregular progressive edge-growth Tanner graphs
- Blind information reconciliation with polar codes for quantum key distribution
- Asymmetric adaptive LDPC-based information reconciliation for industrial quantum key distribution
- Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution
- Using Cascade in Quantum Key Distribution
- Interactive Reconciliation with Low-Density Parity-Check Codes
- Secure rate-adaptive reconciliation
- Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution
- Combined Quantum and Post-Quantum Security for Earth-Satellite Channels