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

IEEE Internet of Things Journal

A Scalable and Lightweight Physical-Layer Key Generation Protocol for Multiuser Wireless Systems

Ehsan Olyaei Torshizi, Anas Alashqar, Werner Henkel

Published Nov 18, 2025• 5 citations
Publisher

Abstract

This paper presents a novel group secret key generation (GSKG) protocol for multi-user wireless systems with a star topology. In contrast to conventional methods relying on pairwise key derivation followed by reconciliation, the proposed approach enables the central node to directly select a group secret key uniformly at random across the full quantization space. This eliminates the need for intermediate pairwise keys, significantly reducing computational complexity, communication overhead, and latency. To ensure consistent group key reconstruction, we introduce two lightweight, non-coding reconciliation techniques: One-Sided Centering (OSC) and Quantization Pattern Alternation (QPA). Unlike coding-based reconciliation in conventional schemes, OSC and QPA allow the central node to transmit helper data – derived from adjusted measurements or shifted quantization grids – to peripheral nodes. This helper data not only aligns their channel observations with the selected quantization region, but also implicitly distributes the group key. Thus, reconciliation and distribution are seamlessly integrated into a unified protocol. The proposed GSKG framework supports both fully and partially cooperative scenarios and remains robust against unreliable or compromised nodes by selectively omitting or perturbing helper data. Furthermore, a concatenation-based group key construction method exploits existing bidirectional channel measurements to generate multiple key segments, enhancing throughput without additional channel probing. Extensive simulations validate the scheme’s performance in terms of key disagreement rate, key generation rate, computational efficiency, and robustness against eavesdropping. The results confirm that the protocol offers high scalability and security, making it a practical and efficient solution for group key establishment in IoT and other resource-constrained wireless applications.

DOI
10.1109/jiot.2025.3633445

Related papers

Multiuser Physical-Layer Key Generation for FDD Wireless Systems

Ehsan Olyaei Torshizi, Anas Alashqar, Werner Henkel

This paper presents a novel group secret key generation (GSKG) protocol for multiuser wireless FDD systems with a star topology. While most existing GSKG schemes are tailored to TDD systems, their counterparts for FDD systems remain largely unexplored due to the inherent lack of reciprocity between uplink and downlink channels. To address this limitation, we exploit the reciprocity of the scattering matrix parameters S12and S21within the same frequency range and utilize amplitude, absolute phase, and phase differences between neighboring antennas as reciprocal features for pairwise key generation. Furthermore, we propose a novel group key construction method based on the concatenation of pairwise keys, combined with a secure group key distribution mechanism that enhances security and increases the effective key length compared to conventional XOR-based approaches. Extensive indoor experiments confirm that the proposed scheme achieves low key disagreement rates, strong randomness, and high robustness against eavesdropping.

International Conference on Communications•May 24, 2026•0 citations

Multi-User Secret Key Generation for WSNs via Wireless Channels

Mehmet Ali Aygül, Ebubekir Memişoğlu, Hakan Ali Cirpan +1 more

Wireless sensor networks (WSNs) are resource-constrained and highly vulnerable to eavesdropping due to their broadcast nature. Traditional symmetric key cryptography provides strong security but imposes excessive computational and energy demands on sensor nodes. Physical layer–based secret key generation (SKG) offers a lightweight alternative by exploiting channel reciprocity and randomness; however, existing methods are mostly limited to two-user scenarios and lack scalability in multi-user settings. This paper introduces two scalable multi-user SKG frameworks: a sequential method and a star topology-based method. In the sequential method, users cooperatively relay random signals to derive a shared key, while the star topology leverages a central node for signal aggregation and redistribution. A comparative analysis reveals trade-offs between the proposed methods. The sequential method is more computationally efficient but sensitive to node failures, while the star topology offers lower delay at the cost of requiring a fully connected central node. Analyses and simulations confirm both methods’ effectiveness in key mismatch probability, key generation rate, and key randomness validated by the National Institute of Standards and Technology test suite.

IEEE Open Journal of the Communications Society•Jan 1, 2025•0 citations

Cooperative Group Secret Key Generation Based on Secure Network Coding

Shuaifang Xiao, Yunfei Guo, Kaizhi Huang +1 more

Most of the existing works on group secret key (GSK) generation are based on pairwise key which wasting the total time and power of the group users. We present a cooperative GSK generation algorithm via star topology with one central node and one reference node. After channel estimation, secure network coding technique is employed by the central node to help all the group users exploit the randomness of reference channel with nothing about that leaking to the eavesdropper. Then all the group users agree on a secret key from the correlative observations of the reference channel in one information reconciliation phase. In addition, the expression of achievable secret key rate is derived. Theoretical and Monte Carlo simulation results validate the performance of our proposed algorithm.

IEEE Communications Letters•Apr 30, 2018•33 citations

A Lightweight Key Generation Scheme for the Internet of Things

Dengke Guo, Kuo Cao, Jun Xiong +2 more

Devices in the Internet of Things (IoT) are usually limited in computing resources and energy capacity, which means that encryption schemes with higher complexity are not suitable for them to ensure secure communication. As a promising solution to this problem, physical layer key generation suggests that shared secret keys can be generated from noisy wireless channel measurements to enhance the security of wireless communications. In this article, we propose a key generation scheme with extremely low implementation complexity, which allows physical layer key generation to be implemented on IoT nodes. First, we preprocess the channel measurements with simple moving average filtering before quantization to improve channel reciprocity. Next, a bidirectional difference quantization scheme is proposed to realize reliable quantization of channel measurements, which is ingenious in that the quantization process does not depend on quantization thresholds, and thus, the mismatched key bits caused by measurements close to quantization thresholds can be effectively avoided. Then, we propose an improved Cascade protocol to achieve lightweight and efficient information reconciliation. The simulation results show that our scheme can well balance the reliability and efficiency of key generation, and has excellent performance in terms of implementation complexity and key randomness.

IEEE Internet of Things Journal•Feb 18, 2021•69 citations

Sharing Secrets via Wireless Broadcasting: A New Efficient Physical Layer Group Secret Key Generation for Multiple IoT Devices

Jie Tang, Hong Wen, Huanhuan Song +2 more

With the increasing demands for sharing confidential information among massive Internet of Things (IoT) devices in 5G and beyond wireless networks, many applications require the common secret key generation for a group of IoT devices. However, most of the existing works on physical layer secret key generation (PLKG) only focus on the pairwise key generation between two users, which is a low efficient and high cost to be extended to the scenarios of group key generation. In this work, we propose a new efficient multiple-input–multiple-output (MIMO) physical layer group secret key generation scheme to reduce the consumption of channel probing and improve the efficiency for group key generation. Different from current schemes, in the proposed scheme, the transmitter randomly generates the group secret key and directly broadcasts the downlink data symbols to the group users. At the receiver end, each group user can efficiently “observe” the common group key through the downlink broadcasting data symbols, while keeping perfect secrecy of the shared group key against eavesdroppers. The performance of reliability, security, and the group key generation rate is fully investigated, which shows the advantages of high efficiency, low consumption, and strong robustness of the proposed scheme. Extensive simulations are conducted to validate the effectiveness of the proposed scheme.

IEEE Internet of Things Journal•Jan 31, 2022•38 citations

A Recovery-Mechanism-Driven Wireless Group Key Generation Protocol for Multiuser Scenarios

Huaicong Zhang, Yawen Huang, Jiabao Yu +2 more

Physical-layer key generation (PKG) leveraging the reciprocity of wireless channel provides an effective approach for key agreement among resource-constrained Internet of Things devices. However, current researches on PKG predominantly focus on pairwise communication scenarios, and there remain challenges in achieving group key generation for multiuser scenarios. In this article, we propose a novel recovery mechanism-driven wireless group key generation protocol to facilitate key sharing in the star network typology. Specifically, the root node will assign each member node its unique group key component before initiating group key distribution. Subsequently, all group key components are distributed to member nodes using a forward error correction mechanism, which helps reduce system overhead. Finally, all member nodes utilize a recovery mechanism and their respective group key component to obtain the same complete group key, thereby achieving group key distribution. Compared to existing schemes, our protocol can avoid the significant information leakage caused by repeated distribution of the same group key, thereby enhancing security. We further design and implement a practical wireless group key generation system using ESP32. Additionally, a group channel state information (CSI) extraction tool for multiuser channel measurements is developed. Experimental results demonstrate that our protocol can generate the group key with high randomness while benefiting from good channel reciprocity, making it suitable for cryptographic applications in multiuser communication scenarios.

IEEE Internet of Things Journal•Nov 20, 2024•3 citations
This paper presents a novel group secret key generation (GSKG) protocol for multi-user wireless systems with a star topology. In contrast to conventional methods relying on pairwise key derivation followed by reconciliation, the proposed approach enables the central node to directly select a group secret key uniformly at random across the full quantization space. This eliminates the need for intermediate pairwise keys, significantly reducing computational complexity, communication overhead, and latency. To ensure consistent group key reconstruction, we introduce two lightweight, non-coding reconciliation techniques: One-Sided Centering (OSC) and Quantization Pattern Alternation (QPA). Unlike coding-based reconciliation in conventional schemes, OSC and QPA allow the central node to transmit helper data – derived from adjusted measurements or shifted quantization grids – to peripheral nodes. This helper data not only aligns their channel observations with the selected quantization region, but also implicitly distributes the group key. Thus, reconciliation and distribution are seamlessly integrated into a unified protocol. The proposed GSKG framework supports both fully and partially cooperative scenarios and remains robust against unreliable or compromised nodes by selectively omitting or perturbing helper data. Furthermore, a concatenation-based group key construction method exploits existing bidirectional channel measurements to generate multiple key segments, enhancing throughput without additional channel probing. Extensive simulations validate the scheme’s performance in terms of key disagreement rate, key generation rate, computational efficiency, and robustness against eavesdropping. The results confirm that the protocol offers high scalability and security, making it a practical and efficient solution for group key establishment in IoT and other resource-constrained wireless applications.
This paper presents a novel group secret key generation (GSKG) protocol for multiuser wireless FDD systems with a star topology. While most existing GSKG schemes are tailored to TDD systems, their counterparts for FDD systems remain largely unexplored due to the inherent lack of reciprocity between uplink and downlink channels. To address this limitation, we exploit the reciprocity of the scattering matrix parameters S12and S21within the same frequency range and utilize amplitude, absolute phase, and phase differences between neighboring antennas as reciprocal features for pairwise key generation. Furthermore, we propose a novel group key construction method based on the concatenation of pairwise keys, combined with a secure group key distribution mechanism that enhances security and increases the effective key length compared to conventional XOR-based approaches. Extensive indoor experiments confirm that the proposed scheme achieves low key disagreement rates, strong randomness, and high robustness against eavesdropping.
Wireless sensor networks (WSNs) are resource-constrained and highly vulnerable to eavesdropping due to their broadcast nature. Traditional symmetric key cryptography provides strong security but imposes excessive computational and energy demands on sensor nodes. Physical layer–based secret key generation (SKG) offers a lightweight alternative by exploiting channel reciprocity and randomness; however, existing methods are mostly limited to two-user scenarios and lack scalability in multi-user settings. This paper introduces two scalable multi-user SKG frameworks: a sequential method and a star topology-based method. In the sequential method, users cooperatively relay random signals to derive a shared key, while the star topology leverages a central node for signal aggregation and redistribution. A comparative analysis reveals trade-offs between the proposed methods. The sequential method is more computationally efficient but sensitive to node failures, while the star topology offers lower delay at the cost of requiring a fully connected central node. Analyses and simulations confirm both methods’ effectiveness in key mismatch probability, key generation rate, and key randomness validated by the National Institute of Standards and Technology test suite.
Most of the existing works on group secret key (GSK) generation are based on pairwise key which wasting the total time and power of the group users. We present a cooperative GSK generation algorithm via star topology with one central node and one reference node. After channel estimation, secure network coding technique is employed by the central node to help all the group users exploit the randomness of reference channel with nothing about that leaking to the eavesdropper. Then all the group users agree on a secret key from the correlative observations of the reference channel in one information reconciliation phase. In addition, the expression of achievable secret key rate is derived. Theoretical and Monte Carlo simulation results validate the performance of our proposed algorithm.
Devices in the Internet of Things (IoT) are usually limited in computing resources and energy capacity, which means that encryption schemes with higher complexity are not suitable for them to ensure secure communication. As a promising solution to this problem, physical layer key generation suggests that shared secret keys can be generated from noisy wireless channel measurements to enhance the security of wireless communications. In this article, we propose a key generation scheme with extremely low implementation complexity, which allows physical layer key generation to be implemented on IoT nodes. First, we preprocess the channel measurements with simple moving average filtering before quantization to improve channel reciprocity. Next, a bidirectional difference quantization scheme is proposed to realize reliable quantization of channel measurements, which is ingenious in that the quantization process does not depend on quantization thresholds, and thus, the mismatched key bits caused by measurements close to quantization thresholds can be effectively avoided. Then, we propose an improved Cascade protocol to achieve lightweight and efficient information reconciliation. The simulation results show that our scheme can well balance the reliability and efficiency of key generation, and has excellent performance in terms of implementation complexity and key randomness.
With the increasing demands for sharing confidential information among massive Internet of Things (IoT) devices in 5G and beyond wireless networks, many applications require the common secret key generation for a group of IoT devices. However, most of the existing works on physical layer secret key generation (PLKG) only focus on the pairwise key generation between two users, which is a low efficient and high cost to be extended to the scenarios of group key generation. In this work, we propose a new efficient multiple-input–multiple-output (MIMO) physical layer group secret key generation scheme to reduce the consumption of channel probing and improve the efficiency for group key generation. Different from current schemes, in the proposed scheme, the transmitter randomly generates the group secret key and directly broadcasts the downlink data symbols to the group users. At the receiver end, each group user can efficiently “observe” the common group key through the downlink broadcasting data symbols, while keeping perfect secrecy of the shared group key against eavesdroppers. The performance of reliability, security, and the group key generation rate is fully investigated, which shows the advantages of high efficiency, low consumption, and strong robustness of the proposed scheme. Extensive simulations are conducted to validate the effectiveness of the proposed scheme.
Physical-layer key generation (PKG) leveraging the reciprocity of wireless channel provides an effective approach for key agreement among resource-constrained Internet of Things devices. However, current researches on PKG predominantly focus on pairwise communication scenarios, and there remain challenges in achieving group key generation for multiuser scenarios. In this article, we propose a novel recovery mechanism-driven wireless group key generation protocol to facilitate key sharing in the star network typology. Specifically, the root node will assign each member node its unique group key component before initiating group key distribution. Subsequently, all group key components are distributed to member nodes using a forward error correction mechanism, which helps reduce system overhead. Finally, all member nodes utilize a recovery mechanism and their respective group key component to obtain the same complete group key, thereby achieving group key distribution. Compared to existing schemes, our protocol can avoid the significant information leakage caused by repeated distribution of the same group key, thereby enhancing security. We further design and implement a practical wireless group key generation system using ESP32. Additionally, a group channel state information (CSI) extraction tool for multiuser channel measurements is developed. Experimental results demonstrate that our protocol can generate the group key with high randomness while benefiting from good channel reciprocity, making it suitable for cryptographic applications in multiuser communication scenarios.