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

Quantum Information and Computation

Demystifying the information reconciliation protocol cascade

Martinez-mateoJesus, PacherChristoph, PeevMomtchil, CiuranaAlex, MartinVicente

Published Apr 1, 2015• 1 citation
Publisher

Abstract

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...
DOI
10.5555/2871401.2871407

Related papers

Demystifying the information reconciliation protocol cascade

Jesús Martínez-Mateo, Christoph Pacher, Momtchil Peev +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 sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.

Quantum Information and Computation•Apr 1, 2015•74 citations

Demystifying the Information Reconciliation Protocol Cascade

Jesús Martínez-Mateo, Christoph Pacher, Momtchil Peev +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 sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.

arXiv:1407.3257•Jul 11, 2014•4 citations

Towards an Optimal Implementation of Cascade

Jesús Martínez-Mateo, Christoph Pacher, Momtchil Peev +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 sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.

•Sep 1, 2014•2 citations

An information reconciliation protocol for secret-key agreement with small leakage

Christoph Pacher, Philipp Grabenweger, Jesús Martínez-Mateo +1 more

We report on a highly efficient information reconciliation protocol for the binary symmetric channel (BSC) with feedback, proposed to be used in the context of secret-key agreement. This is a variant of the so-called Cascade protocol. Simulations determine efficiencies, defined by the ratio of actual transmitted information to the necessary amount of information, of approximately 1.025 for a frame length of 214bits and a frame error rate of typically 10−4. The proposed algorithm works for any BSC parameter between 0 and 0.5.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•17 citations

Information Reconciliation for Quantum Key Distribution

David Elkouss, Jesús Martínez-Mateo, Vicente Martín Ayuso +1 more

Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and 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 all QKD practical implementations. However, it is highly interactive, requiring many communications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.

•Oct 1, 2010•31 citations

Information Reconciliation Protocol in Quantum Key Distribution System

Hao Yan, Tienan Ren, Xiang Peng +4 more

In the system of quantum key distribution (QKD), errors may occur in the initial keys due to system noise or eavesdropping during the transmission on quantum channel. The goal of information reconciliation is to remove these errors by exchanging messages on an authenticated public channel. In this paper, we discuss the problem of secrete key reconciliation (SKR) in QKD, analyze the cascade protocol used for SKR, then modify it according to our conclusion. Experiments have shown that the modified protocol is of much higher efficiency.

International Conference on Natural Computation (ICNC)•Jan 1, 2008•46 citations
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 sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.
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 sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.
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 sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed and, although its efficiency is not optimal, it has become the de-facto standard for practical implementations of information reconciliation in quantum key distribution. The aim of this work is to analyze the performance of Cascade, to discuss its strengths, weaknesses and optimization possibilities, comparing with some of the modified versions that have been proposed in the literature. When looking at all design trade-offs, a new view emerges that allows to put forward a number of guidelines and propose near optimal parameters for the practical implementation of Cascade improving performance significantly in comparison with all previous proposals.
We report on a highly efficient information reconciliation protocol for the binary symmetric channel (BSC) with feedback, proposed to be used in the context of secret-key agreement. This is a variant of the so-called Cascade protocol. Simulations determine efficiencies, defined by the ratio of actual transmitted information to the necessary amount of information, of approximately 1.025 for a frame length of 214bits and a frame error rate of typically 10−4. The proposed algorithm works for any BSC parameter between 0 and 0.5.
Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation process is a classical one in which basis reconciliation, error correction and privacy amplification protocols are applied to the raw key. This cleaning process is known as information reconciliation and must be done in a fast and efficient way to avoid cramping the performance of the QKD system. Brassard and 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 all QKD practical implementations. However, it is highly interactive, requiring many communications between the legitimate parties and its efficiency is not optimal, imposing an early limit to the maximum tolerable error rate. In this paper we describe a low-density parity-check reconciliation protocol that improves significantly on these problems. The protocol exhibits better efficiency and limits the number of uses of the communications channel. It is also able to adapt to different error rates while remaining efficient, thus reaching longer distances or higher secure key rate for a given QKD system.
In the system of quantum key distribution (QKD), errors may occur in the initial keys due to system noise or eavesdropping during the transmission on quantum channel. The goal of information reconciliation is to remove these errors by exchanging messages on an authenticated public channel. In this paper, we discuss the problem of secrete key reconciliation (SKR) in QKD, analyze the cascade protocol used for SKR, then modify it according to our conclusion. Experiments have shown that the modified protocol is of much higher efficiency.