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

Computer Networks

An efficient physical layer information reconciliation protocol

Xingyu Xiao, Gang Xin, Jian Zhang, Kexin Wang, Jia-Ning Guo

Published Feb 3, 2026• 0 citations
Publisher
DOI
10.1016/j.comnet.2026.112080

Related papers

Information reconciliation schemes in physical-layer security: A survey

Christopher Huth, René Guillaume, Thomas Strohm +3 more

Computer Networks•Jun 18, 2016•75 citations

Towards practical reconciliation leakage analysis in Physical Layer Key Generation: Verifying the advantage of interactive protocols

Xingyu Xiao, Gang Xin, Jian Zhang +3 more

Computer Networks•Aug 29, 2026•0 citations

A Hybrid Information Reconciliation Method for Physical Layer Key Generation

Guyue Li, Zheying Zhang, Yi Yu +1 more

Physical layer key generation (PKG) has become a research focus as it solves the key distribution problem, which is difficult in traditional cryptographic mechanisms. Information reconciliation is a critical process in PKG to obtain symmetric keys. Various reconciliation schemes have been proposed, including the error detection protocol-based approach (EDPA) and error correction code-based approach (ECCA). Both EDPA and ECCA have advantages and drawbacks, regarding information leakage, interaction delay, and computation complexity. In this paper, we choose the BBBSS protocol from EDPA and BCH code from ECCA as a case study, analyzing their comprehensive efficiency performance versus pass number and bit disagreement ratio (BDR), respectively. Next, we integrate the strength of the two to design a new hybrid information reconciliation protocol (HIRP). The design of HIRP consists of three main phases, i.e., training, table lookup, and testing. To comprehensively evaluate the reconciliation schemes, we propose a novel efficiency metric to achieve a balance of corrected bits, information leakage, time delay, and computation time, which represents the effectively corrected bits per unit time. The simulation results show that our proposed method outperforms other reconciliation schemes to improve the comprehensive reconciliation efficiency. The average improvement in efficiency is 2.48 and 22.36 times over the BBBSS and BCH code, respectively, when the range of the BDR is from 0.5% to 11.5%. Compared to the BBBSS protocol and the BCH code, HIRP lies at a mid-level in terms of information leakage and computation time cost. Besides, with the lowest time delay cost, HIRP reaches the highest reconciliation efficiency.

Entropy•Jul 14, 2019•29 citations

An Adaptive Information Reconciliation Protocol for Physical-Layer Based Secret Key Generation

Zheying Zhang, Guyue Li, Aiqun Hu

Physical-layer based secret key generation (SKG) becomes a research focus as it solves key distribution problem which is difficult in traditional cryptographic mechanism. To remove the disagreements caused by imperfect reciprocity of communicating parties, information reconciliation is a critical process in SKG to obtain symmetric keys. Various reconciliation schemes are proposed, e.g. BBBSS, Cascade, BCH code and Turbo code. Reconciliation efficiency is a common evaluation index which takes reconciliation success rate and information leakage rate into account. However, time delay caused by information interaction and computation overhead may affect reconciliation performance under specific scenarios. Therefore, a comprehensive evaluation metric is required to compare existing schemes. Besides, channel condition changes all the time in real mobile communication systems, and most existing reconciliation schemes only work well in certain channel conditions. Hence, a reconciliation scheme which can adapt to time-varying channel condition is required. In this paper, we introduce a novel comprehensive reconciliation efficiency index (CREI) to evaluate existing reconciliation schemes and propose an adaptive information reconciliation scheme selection (AIRSS) protocol to maximize CREI. The simulation results show the superiority of AIRSS and present recommendations of reconciliation scheme selection in different scenarios.

IEEE Vehicular Technology Conference•Apr 1, 2019•10 citations

Physical-Layer Key Generation and Reconciliation

Jon W. Wallace, Rashid Mehmood, R. K. Sharma +4 more

Signals and communication technology•Jan 1, 2016•3 citations

Communication Security through Physical-Layer Techniques

Ahmed Aladi

•Aug 1, 2023•0 citations
Physical layer key generation (PKG) has become a research focus as it solves the key distribution problem, which is difficult in traditional cryptographic mechanisms. Information reconciliation is a critical process in PKG to obtain symmetric keys. Various reconciliation schemes have been proposed, including the error detection protocol-based approach (EDPA) and error correction code-based approach (ECCA). Both EDPA and ECCA have advantages and drawbacks, regarding information leakage, interaction delay, and computation complexity. In this paper, we choose the BBBSS protocol from EDPA and BCH code from ECCA as a case study, analyzing their comprehensive efficiency performance versus pass number and bit disagreement ratio (BDR), respectively. Next, we integrate the strength of the two to design a new hybrid information reconciliation protocol (HIRP). The design of HIRP consists of three main phases, i.e., training, table lookup, and testing. To comprehensively evaluate the reconciliation schemes, we propose a novel efficiency metric to achieve a balance of corrected bits, information leakage, time delay, and computation time, which represents the effectively corrected bits per unit time. The simulation results show that our proposed method outperforms other reconciliation schemes to improve the comprehensive reconciliation efficiency. The average improvement in efficiency is 2.48 and 22.36 times over the BBBSS and BCH code, respectively, when the range of the BDR is from 0.5% to 11.5%. Compared to the BBBSS protocol and the BCH code, HIRP lies at a mid-level in terms of information leakage and computation time cost. Besides, with the lowest time delay cost, HIRP reaches the highest reconciliation efficiency.
Physical-layer based secret key generation (SKG) becomes a research focus as it solves key distribution problem which is difficult in traditional cryptographic mechanism. To remove the disagreements caused by imperfect reciprocity of communicating parties, information reconciliation is a critical process in SKG to obtain symmetric keys. Various reconciliation schemes are proposed, e.g. BBBSS, Cascade, BCH code and Turbo code. Reconciliation efficiency is a common evaluation index which takes reconciliation success rate and information leakage rate into account. However, time delay caused by information interaction and computation overhead may affect reconciliation performance under specific scenarios. Therefore, a comprehensive evaluation metric is required to compare existing schemes. Besides, channel condition changes all the time in real mobile communication systems, and most existing reconciliation schemes only work well in certain channel conditions. Hence, a reconciliation scheme which can adapt to time-varying channel condition is required. In this paper, we introduce a novel comprehensive reconciliation efficiency index (CREI) to evaluate existing reconciliation schemes and propose an adaptive information reconciliation scheme selection (AIRSS) protocol to maximize CREI. The simulation results show the superiority of AIRSS and present recommendations of reconciliation scheme selection in different scenarios.