Experimental quantum cryptography
Journal of Cryptology - Eurocrypt '90
Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Quantum computation and quantum information
Quantum computation and quantum information
A Practical Protocol for Advantage Distillation and Information Reconciliation
Designs, Codes and Cryptography
Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
EURASIP Journal on Wireless Communications and Networking
Quantum Cryptography and Secret-Key Distillation
Quantum Cryptography and Secret-Key Distillation
Efficient reconciliation protocol for discrete-variable quantum key distribution
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Improved construction of irregular progressive edge-growth tanner graphs
IEEE Communications Letters
Auto-adaptive interval selection algorithm for quantum key distribution
Quantum Information & Computation
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
Proof of security of quantum key distribution with two-way classical communications
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Quantum Information & Computation
A multiparty error-correcting method for quantum secret sharing
Quantum Information Processing
| Hi-index | 0.00 |
Quantum key distribution (QKD) relies on quantum and classical procedures in orderto achieve the growing of a secret random string --the key-- known only to the twoparties executing the protocol. Limited intrinsic efficiency of the protocol, imperfectdevices and eavesdropping produce errors and information leakage from which the set ofmeasured signals --the raw key-- must be stripped in order to distill a final, informationtheoretically secure, key. The key distillation process is a classical one in which basisreconciliation, error correction and privacy amplification protocols are applied to the rawkey. This cleaning process is known as information reconciliation and must be done in afast and efficient way to avoid cramping the performance of the QKD system. Brassardand Salvail proposed a very simple and elegant protocol to reconcile keys in the secret-key agreement context, known as Cascade, that has become the de-facto standard for allQKD practical implementations. However, it is highly interactive, requiring many com-munications between the legitimate parties and its efficiency is not optimal, imposing anearly limit to the maximum tolerable error rate. In this paper we describe a low-densityparity-check reconciliation protocol that improves significantly on these problems. Theprotocol exhibits better efficiency and limits the number of uses of the communicationschannel. It is also able to adapt to different error rates while remaining efficient, thusreaching longer distances or higher secure key rate for a given QKD system.