Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A Practical Protocol for Advantage Distillation and Information Reconciliation
Designs, Codes and Cryptography
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Reconciliation of a quantum-distributed Gaussian key
IEEE Transactions on Information Theory
Improved construction of irregular progressive edge-growth tanner graphs
IEEE Communications Letters
Information reconciliation for quantum key distribution
Quantum Information & Computation
Low-power secret-key agreement over OFDM
Proceedings of the 2nd ACM workshop on Hot topics on wireless network security and privacy
High performance error correction for quantum key distribution using polar codes
Quantum Information & Computation
| Hi-index | 0.00 |
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 binary symmetric channel (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.