Blind reconciliation

@article{MartnezMateo2012BlindR,
  title={Blind reconciliation},
  author={Jes{\'u}s Mart{\'i}nez-Mateo and David Elkouss and Vicente Mart{\'i}n},
  journal={Quantum Inf. Comput.},
  year={2012},
  volume={12},
  pages={791-812}
}
Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation efficiency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close to minimal information disclosure but heavily interactive procedures, like Cascade, or using less… 

Figures from this paper

Rate-Adaptive LDPC-based key reconciliation for high performance quantum key distribution

Modern coding techniques, such as rate-adaptive low-density parity-check (LDPC) codes were also shown to achieve similar efficiency values exchanging only one message, or even better values with few interactivity and shorter block-length codes.

Improved reconciliation with polar codes in quantum key distribution

The use of polar codes is demonstrated to improve the performance of information reconciliation in a QKD system with small block size and proposes a method that allows arbitrarily obtained sifted keys to be CRC precoded by introducing a virtual string.

Rate-adaptive reconciliation and its estimator for quantum bit error rate

A rate-adaptive method is proposed by means of a channel coding scheme where specific low-density parity-check (LDPC) codes are adapted in the Slepian-Wolf coding system that improves the reconciliation efficiency with minimal interaction and increases the size of the final secret key.

Blind reconciliation based on inverse encoding of polar codes with adaptive step sizes for quantum key distribution

A blind reconciliation scheme based on the inverse encoding of polar codes with adaptive step sizes that improves the overall final secret key rate of a practical QKD system through step-size adaptation and decreases the consumption of truly random bits, communication, and computational resources through inverse encoding.

Blind information reconciliation with variable step sizes for quantum key distribution

This work proposes a blind reconciliation protocol with variable step sizes that can obtain better reconciliation efficiency with less operation time and enhances the final secret key rate and accelerates the processing speed of a QKD system.

Error Estimation at the Information Reconciliation Stage of Quantum Key Distribution

This work considers different approaches to the quantum bit error rate (QBER) estimation at the information reconciliation stage of the post-processing procedure, and develops a novel syndrome-based QBER estimation algorithm for reconciliation schemes employing low-density parity-check codes.

High-Efficient Syndrome-Based LDPC Reconciliation for Quantum Key Distribution

A novel syndrome-based low-density parity-check (LDPC) reconciliation protocol to reduce the information leakage of reconciliation by fully utilizing the syndrome information that was previously wasted is proposed.

Key Reconciliation for High Performance Quantum Key Distribution

It is argued that it is the throughput the significant magnitude in practical QKD, specially in the case of high speed devices, where the differences are more marked, and some examples contrasting the usual postprocessing schemes with new ones from modern coding theory are given.

Easily Implemented Rate Compatible Reconciliation Protocol for Quantum Key Distribution

A new rate compatible reconciliation scheme based on Row Combining with Edge Variation (RCEV) Low Density Parity Check (LDPC) codes which could change code rate adaptively in noisy channel where error rate may change with time.

Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution

This protocol changes the code rate of multi-edge type low density parity check codes, by puncturing and shortening techniques, to enlarge the correctable signal-to-noise ratios regime, thus improves the overall reconciliation efficiency comparing to the original fixed rate reconciliation protocol.

References

SHOWING 1-10 OF 37 REFERENCES

Interactive reconciliation with low-density parity-check codes

This work proposes an interactive protocol for information reconciliation based on low-density parity-check codes that is adapted in real time by using simultaneously puncturing and shortening strategies, allowing it to cover a predefined error rate range with just a single code.

A Practical Protocol for Advantage Distillation and Information Reconciliation

A general protocol to implement both advantage distillation and information reconciliation in the case when two legitimate users start in a situation which is inferior to that of the adversary Eve is presented.

Fast, efficient error reconciliation for quantum cryptography

A detailed mathematical analysis of the Winnow protocol is presented in the context of practical implementations of quantum-key distribution, finding the information overhead required for secure implementation is one of the most important criteria in the evaluation of a particular error-reconciliation protocol.

Quantum Cryptography

A remarkable surge of interest in the international scientific and industrial community has propelled quantum cryptography into mainstream computer science and physics and it is becoming increasingly practical at a fast pace.

Experimental quantum cryptography

An apparatus and protocol designed to implement quantum key distribution is described, by which two users exchange a random quantum transmission, consisting of very faint flashes of polarized light, which remains secure against an adversary with unlimited computing power.

High‐speed QKD Reconciliation using Forward Error Correction

A new error correction protocol for quantum key distribution using forward error correction techniques which is suitable for very high‐speed implementations and can achieve an order of magnitude greater efficiency than Cascade in communication cost and computation speed.

Quantum cryptography in practice

This paper introduces quantum cryptography, discusses its relation to modern secure networks, and describes its unusual physical layer, its specialized quantum cryptographic protocol suite, and the extensions to IPsec to integrate it with quantum cryptography.

Waterfall performance analysis of finite-length LDPC codes on symmetric channels

This method is based on studying the variations of the channel quality around its expected value when observed during the transmission of a finite-length codeword and can closely predict the performance of LDPC codes of a few thousand bits or longer in the waterfall region.

Security of quantum key distribution with imperfect devices

This paper prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the source and detector are under the limited control of an adversary. This proof

Rate-compatible puncturing of low-density parity-check codes

It is shown that good puncturing patterns exist and that the puncturing can be performed in a rate-compatible fashion, which allows one to implement a single "mother" encoder and decoder that is good across a wide range of rates.