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

International Conference on Information Science, Electrical and Automation Engineering (ISEAE)

A new method for secret-key reconciliation

Keming Tian, Gang Xin, Jian Zhang

Published Sep 27, 2024• 0 citations
Publisher
DOI
10.1117/12.3037714

Related papers

Secret-Key Reconciliation by Public Discussion

Gilles Brassard A, Louis Salvail

Springer eBooks•Jul 31, 2007•781 citations

A Study on Secret key Reconciliation Protocol "Cascade"

Tomohiro Sugimoto, Kouichi Yamazaki

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 25, 2000•49 citations

Reverse Reconciliation for Optimal Error Correction in Quantum Key Distribution

Luis Adrián Lizama-Pérez

In this work, we introduce a new method for the establishment of a symmetric secret key through the reconciliation process in QKD systems that, we claim, is immune to the error rate of the quantum channel and, therefore, has an efficiency of 100% since it does not present losses during the distillation of secret keys. Furthermore, the secret rate is scaled to the square of the number of pulses on the destination side. The method only requires a single data exchange from Bob over the classic channel. We affirmed that our results constitute a milestone in the field of QKD and error correction methods at a crucial moment in the development of classical and quantum cryptanalytic algorithms. We believe that the properties of our method can be evaluated directly since it does not require the use of complex formal-theoretical techniques. For this purpose, we provide a detailed description of the reconciliation algorithm. The strength of the method against PNS and IR attacks is discussed. Furthermore, we define a method to analyze the security of the reconciliation approach based on frames that are binary arrays of 2×2. As a result, we came to the conclusion that the conjugate approach can no longer be considered secure, while we came up with a way to increase the secret gain of the method with measured bits.

Symmetry•Mar 12, 2023•4 citations

Arithmetic Reconciliation for CVQKD: Challenges and Feasibility

Rávilla R. S. Leite, Juliana M. de Assis, Micael A. Dias +1 more

Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs. In this paper, we obtain reconciliation efficiencies for this protocol in realistic scenarios, by means of estimation of mutual information, and we also present rates for sequence match of secret keys by Alice and Bob. Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.

quant-pharXiv:2602.05526•Feb 6, 2026•0 citations

Secret key sharing and secret key generation

van Me Marten Dijk

•Jan 1, 1997•26 citations

Secure schemes for secret sharing and key distribution

Amos Beimel

•Jan 1, 1996•782 citations
In this work, we introduce a new method for the establishment of a symmetric secret key through the reconciliation process in QKD systems that, we claim, is immune to the error rate of the quantum channel and, therefore, has an efficiency of 100% since it does not present losses during the distillation of secret keys. Furthermore, the secret rate is scaled to the square of the number of pulses on the destination side. The method only requires a single data exchange from Bob over the classic channel. We affirmed that our results constitute a milestone in the field of QKD and error correction methods at a crucial moment in the development of classical and quantum cryptanalytic algorithms. We believe that the properties of our method can be evaluated directly since it does not require the use of complex formal-theoretical techniques. For this purpose, we provide a detailed description of the reconciliation algorithm. The strength of the method against PNS and IR attacks is discussed. Furthermore, we define a method to analyze the security of the reconciliation approach based on frames that are binary arrays of 2×2. As a result, we came to the conclusion that the conjugate approach can no longer be considered secure, while we came up with a way to increase the secret gain of the method with measured bits.
Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs. In this paper, we obtain reconciliation efficiencies for this protocol in realistic scenarios, by means of estimation of mutual information, and we also present rates for sequence match of secret keys by Alice and Bob. Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.