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

**Authors:** A.K. Fedorov, E.O. Kiktenko, A.S. Trushechkin

arXiv: 1705.06664 · 2018-09-25

## TL;DR

This paper introduces a symmetric blind information reconciliation protocol using LDPC codes and a hash-based verification method to improve error correction and key verification in quantum key distribution.

## Contribution

It proposes a novel symmetric blind reconciliation method combined with an $$-universal hash verification for enhanced QKD security and efficiency.

## Key findings

- Improved error correction in QKD through symmetric blind reconciliation.
- Effective key verification using $$-universal hash functions.
- Potential for increased security and reliability in quantum communication.

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1705.06664/full.md

## Figures

1 figure with captions in the complete paper: https://tomesphere.com/paper/1705.06664/full.md

## References

21 references — full list in the complete paper: https://tomesphere.com/paper/1705.06664/full.md

---
Source: https://tomesphere.com/paper/1705.06664