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

Journal of Experimental and Theoretical Physics Letters

On the privacy-preserving cascade method for correcting errors in primary keys in quantum cryptography

Andrey V. Timofeev, S. N. Molotkov

Published Dec 1, 2005• 1 citation
Publisher

Abstract

A general method is proposed for privacy protection upon correction of errors in primary keys in quantum cryptography through an open communication channel. By the example of the cascade procedure for correcting errors, a method is described for removing information sent through an open communication channel when cleaning a key. The critical percentage is found for the quantum cryptography protocol BB84 to which the cascade error correction method with deletion guarantees the security of the final key. The method proposed for removing information sent through the open communication channel is quite general and can be used for many cleaning protocols for primary keys in quantum cryptography.

DOI
10.1134/1.2175246

Related papers

Method for decoupling error correction from privacy amplification

Hoi‐Kwong Lo

In a standard quantum key distribution (QKD) scheme such as BB84, two procedures, error correction and privacy amplification, are applied to extract a final secure key from a raw key generated from quantum transmission. To simplify the study of protocols, it is commonly assumed that the two procedures can be decoupled from each other. While such a decoupling assumption may be valid for individual attacks, it is actually unproven in the context of ultimate or unconditional security, which is the Holy Grail of quantum cryptography. In particular, this means that the application of standard efficient two-way error-correction protocols like Cascade is not proven to be unconditionally secure. Here, I provide the first proof of such a decoupling principle in the context of unconditional security. The method requires Alice and Bob to share some initial secret string and use it to encrypt their communications in the error correction stage using one-time-pad encryption. Consequently, I prove the unconditional security of the interactive Cascade protocol proposed by Brassard and Salvail for error correction and modified by one-time-pad encryption of the error syndrome, followed by the random matrix protocol for privacy amplification. This is an efficient protocol in terms of both computational power and key generation rate. My proof uses the entanglement purification approach to security proofs of QKD. The proof applies to all adaptive symmetric methods for error correction, which cover all existing methods proposed for BB84. In terms of the net key generation rate, the new method is as efficient as the standard Shor-Preskill proof.

arXiv:quant-ph/0201030•New Journal of Physics•Apr 24, 2003•35 citations

Practical error-correction procedures in quantum cryptography

A. P. Makkaveev, S. N. Molotkov, D. I. Pomozov +1 more

Quantum cryptography (secure key distribution) systems must include procedures for correcting errors in the raw key transmitted over a quantum communication channel. Several reconciliation protocols are discussed and compared in terms of efficiency.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 24, 2006•3 citations

Practical error-correction procedures in quantum cryptography

A. P. Makkaveev, S. N. Molotkov, D. I. Pomozov +1 more

Quantum cryptography (secure key distribution) systems must include procedures for correcting errors in the raw key transmitted over a quantum communication channel. Several reconciliation protocols are discussed and compared in terms of efficiency.

Journal of Experimental and Theoretical Physics•Aug 1, 2005•8 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 for Quantum Key Distribution

David Elkouss, Jesús Martínez-Mateo, Vicente Martín

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.

arXiv:1007.1616•Jul 9, 2010•5 citations

Quantum Error Correction Code-Based Privacy Computation Protocol Design

Jincheng Zhang

This paper presents a novel privacy computation protocol design leveraging the inherent properties of quantum error correction (QEC) codes. The core idea is to encode quantum computation data into QEC codes and perform error correction during the computation process, thereby safeguarding data privacy. This approach significantly enhances the security of privacy protection compared to traditional methods. The protocol utilizes a specific QEC code structure to minimize information leakage while performing the desired computation. This design addresses a critical challenge in privacy-preserving quantum computing – the vulnerability of quantum data to eavesdropping – offering a potential pathway towards secure multi-party quantum computation. The effectiveness of the protocol is demonstrated through a theoretical analysis, outlining its key components and security guarantees.

•Sep 3, 2026•0 citations
A general method is proposed for privacy protection upon correction of errors in primary keys in quantum cryptography through an open communication channel. By the example of the cascade procedure for correcting errors, a method is described for removing information sent through an open communication channel when cleaning a key. The critical percentage is found for the quantum cryptography protocol BB84 to which the cascade error correction method with deletion guarantees the security of the final key. The method proposed for removing information sent through the open communication channel is quite general and can be used for many cleaning protocols for primary keys in quantum cryptography.
In a standard quantum key distribution (QKD) scheme such as BB84, two procedures, error correction and privacy amplification, are applied to extract a final secure key from a raw key generated from quantum transmission. To simplify the study of protocols, it is commonly assumed that the two procedures can be decoupled from each other. While such a decoupling assumption may be valid for individual attacks, it is actually unproven in the context of ultimate or unconditional security, which is the Holy Grail of quantum cryptography. In particular, this means that the application of standard efficient two-way error-correction protocols like Cascade is not proven to be unconditionally secure. Here, I provide the first proof of such a decoupling principle in the context of unconditional security. The method requires Alice and Bob to share some initial secret string and use it to encrypt their communications in the error correction stage using one-time-pad encryption. Consequently, I prove the unconditional security of the interactive Cascade protocol proposed by Brassard and Salvail for error correction and modified by one-time-pad encryption of the error syndrome, followed by the random matrix protocol for privacy amplification. This is an efficient protocol in terms of both computational power and key generation rate. My proof uses the entanglement purification approach to security proofs of QKD. The proof applies to all adaptive symmetric methods for error correction, which cover all existing methods proposed for BB84. In terms of the net key generation rate, the new method is as efficient as the standard Shor-Preskill proof.
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.
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.
This paper presents a novel privacy computation protocol design leveraging the inherent properties of quantum error correction (QEC) codes. The core idea is to encode quantum computation data into QEC codes and perform error correction during the computation process, thereby safeguarding data privacy. This approach significantly enhances the security of privacy protection compared to traditional methods. The protocol utilizes a specific QEC code structure to minimize information leakage while performing the desired computation. This design addresses a critical challenge in privacy-preserving quantum computing – the vulnerability of quantum data to eavesdropping – offering a potential pathway towards secure multi-party quantum computation. The effectiveness of the protocol is demonstrated through a theoretical analysis, outlining its key components and security guarantees.