Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A New Information Reconciliation Protocol for Key Agreement

Yuanzhe Shi, Zhao-Yu Shang, Heng-yuan WANG, Yang Hong-qi

Published Jul 1, 2026• 0 citations
Publisher
DOI
10.1109/icsip70099.2026.11744360

Related papers

Key agreement protocols and their security analysis

Simon Blake-Wilson⋆⋆, Don B. Johnson, Alfred Menezes

Lecture notes in computer science•Jan 1, 1997•601 citations

Rate compatible protocol for information reconciliation: An application to QKD

David Elkouss, Jesús Martínez-Mateo, Daniel Lancho Lancho +1 more

Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rate compatible construction of Low Density Parity Check codes. Our protocol improves the efficiency of the reconciliation for the whole range of error rates in the discrete variable QKD context. Its adaptability together with its low interactivity makes it specially well suited for QKD reconciliation.

arXiv:1006.2660•IEEE Information Theory Workshop (ITW)•Jan 1, 2010•46 citations

Reliability-Based Sliced Error Correction in Secret Key Agreement from Fading Channel

Takay Shimizu, Hisato Iwai, Hideichi Sasaoka

We consider information reconciliation in secret key agreement from a fading channel where two legitimate parties utilize channel estimates of their fading channel as correlated random variables to generate a secret key. The information reconciliation is a process of correcting the discrepancies between the legitimate parties' keys by public discussion in the presence of eavesdropper, where the amount of the information revealed in the public discussion is needed to be as little as possible. In this paper, we propose information reconciliation protocols using the reliability values of channel estimates in order to correct errors effectively. The proposed information reconciliation protocols are modified versions of a protocol used in quantum key distribution called sliced error correction using Cascade. Simulation results show that the proposed protocols can correct errors with less the number of disclosed bits and less the number of communications than the conventional sliced error correction using Cascade.

IEEE Wireless Communications and Networking Conference•Apr 1, 2010•7 citations

Key Agreement Protocols

Colin Boyd, Anish Mathuria

Information security and cryptography•Jan 1, 2003•7 citations

Demystifying the information reconciliation protocol cascade

Martinez-mateoJesus, PacherChristoph, PeevMomtchil +2 more

Cascade is an information reconciliation protocol proposed in the context of secret key agreement in quantum cryptography. This protocol allows removing discrepancies in two partially correlated se...

Quantum Information and Computation•Apr 1, 2015•1 citation

Key Agreement Protocols

Colin Boyd, Anish Mathuria, Douglas Stebila

Information security and cryptography•Nov 6, 2019•1 citation
Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rate compatible construction of Low Density Parity Check codes. Our protocol improves the efficiency of the reconciliation for the whole range of error rates in the discrete variable QKD context. Its adaptability together with its low interactivity makes it specially well suited for QKD reconciliation.
We consider information reconciliation in secret key agreement from a fading channel where two legitimate parties utilize channel estimates of their fading channel as correlated random variables to generate a secret key. The information reconciliation is a process of correcting the discrepancies between the legitimate parties' keys by public discussion in the presence of eavesdropper, where the amount of the information revealed in the public discussion is needed to be as little as possible. In this paper, we propose information reconciliation protocols using the reliability values of channel estimates in order to correct errors effectively. The proposed information reconciliation protocols are modified versions of a protocol used in quantum key distribution called sliced error correction using Cascade. Simulation results show that the proposed protocols can correct errors with less the number of disclosed bits and less the number of communications than the conventional sliced error correction using Cascade.