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

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

Xingyu Xiao, Gang Xin, Jian Zhang, Kexin Wang, Dongqin Guo, Ruijie Duan

Published Aug 29, 2026• 0 citations
Publisher
DOI
10.1016/j.comnet.2026.112713

Related papers

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

Information reconciliation schemes in physical-layer security: A survey

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

Computer Networks•Jun 18, 2016•75 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

A Novel Hybrid Protocol and Code Related Information Reconciliation Scheme for Physical Layer Secret Key Generation

Et al. Sujata Kadam

Wireless networks are vulnerable to various attacks due to their open nature, making them susceptible to eavesdropping and other security threats. Eavesdropping attack takes place at the physical layer. Traditional wireless network security relies on cryptographic techniques to secure data transmissions. However, these techniques may not be suitable for all scenarios, especially in resource-constrained environments such as wireless sensor networks and adhoc networks. In these networks having limited power resources, generating cryptographic keys between mobile entities can be challenging. Also, the cryptographic keys are computationally complex and require key management infrastructure. Physical Layer Key Generation (PLKG) is an emerging solution to address these challenges. It establishes secure communication between two users by taking advantage of the wireless channel's inherent features. PLKG process involves channel probing, quantization, information reconciliation (IR) and privacy amplification to generate symmetric secret key. The researchers have used various PLKG techniques to get the secret key, sTop of Form till they face problems in the IR scheme to obtain symmetric keys between the users who share the same channel for communication. Both the code based and protocol based methods proposed in the literature have advantages and limitations related to their performance parameters such as information leakage, interaction delay and computation complexity. This research work proposes a novel IR mechanism that combines the protocol and code-based error correction methods to obtain reduced Bit Mismatch Rate (BMR), reduced information leakage, reduced interaction delay, and reduced computational time to enhance physical layer secret key's quality. In the proposed research work, the channel samples are generated using the Received Signal Strength (RSS) and Channel Impulse Response (CIR) parameters. These samples are quantized using Vector Quantization with Affinity Propagation Clustering (VQAPC) method to generate the preliminary key. The samples collected by the two users who wish to communicate, (for example Alice and Bob) will be different due to noise in the channel and hardware limitations. Hence their preliminary keys will be different. Removing this discrepancy between Bob's and Alice's initial keys, using novel Hybrid Protocol and Code related Information Reconciliation (HPC-IR) scheme to generate error corrected key, is the most important contribution of this research work. This key is further encoded by the MD5 hash function to generate a final secret key for exchanging information between two users over the wireless channel. It is observed that the proposed HPC-IR scheme achieves BMR of 19.4%, information leakage is 0.002, interaction delay is 0.001 seconds and computation time is 0.02 seconds.

International Journal on Recent and Innovation Trends in Computing and Communication•Nov 5, 2023•0 citations

Min-Entropy Estimation for Physical Layer Key Generation: An Empirical Study

Dongchi Han, Yuan Ma, Tianyu Chen +2 more

Lecture notes in computer science•Jan 1, 2026•0 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 (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.
Wireless networks are vulnerable to various attacks due to their open nature, making them susceptible to eavesdropping and other security threats. Eavesdropping attack takes place at the physical layer. Traditional wireless network security relies on cryptographic techniques to secure data transmissions. However, these techniques may not be suitable for all scenarios, especially in resource-constrained environments such as wireless sensor networks and adhoc networks. In these networks having limited power resources, generating cryptographic keys between mobile entities can be challenging. Also, the cryptographic keys are computationally complex and require key management infrastructure. Physical Layer Key Generation (PLKG) is an emerging solution to address these challenges. It establishes secure communication between two users by taking advantage of the wireless channel's inherent features. PLKG process involves channel probing, quantization, information reconciliation (IR) and privacy amplification to generate symmetric secret key. The researchers have used various PLKG techniques to get the secret key, sTop of Form till they face problems in the IR scheme to obtain symmetric keys between the users who share the same channel for communication. Both the code based and protocol based methods proposed in the literature have advantages and limitations related to their performance parameters such as information leakage, interaction delay and computation complexity. This research work proposes a novel IR mechanism that combines the protocol and code-based error correction methods to obtain reduced Bit Mismatch Rate (BMR), reduced information leakage, reduced interaction delay, and reduced computational time to enhance physical layer secret key's quality. In the proposed research work, the channel samples are generated using the Received Signal Strength (RSS) and Channel Impulse Response (CIR) parameters. These samples are quantized using Vector Quantization with Affinity Propagation Clustering (VQAPC) method to generate the preliminary key. The samples collected by the two users who wish to communicate, (for example Alice and Bob) will be different due to noise in the channel and hardware limitations. Hence their preliminary keys will be different. Removing this discrepancy between Bob's and Alice's initial keys, using novel Hybrid Protocol and Code related Information Reconciliation (HPC-IR) scheme to generate error corrected key, is the most important contribution of this research work. This key is further encoded by the MD5 hash function to generate a final secret key for exchanging information between two users over the wireless channel. It is observed that the proposed HPC-IR scheme achieves BMR of 19.4%, information leakage is 0.002, interaction delay is 0.001 seconds and computation time is 0.02 seconds.
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.