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

Globecom

Secret Group Key Generation in Physical Layer for Mesh Topology

Chan Dai Truyen Thai, Jemin Lee, Tony Q. S. Quek

Published Dec 1, 2015• 28 citations
Publisher

Abstract

Secret group key generation based on physical layer in wireless communications has a lot of practical applications. A few studies focused on the theoretical bounds of the secret key rate based on the sets of received signals rather than a particular secret key generation scheme. We propose a secret group key generation scheme for an arbitrary number of legitimate nodes, n, in mesh topology in the presence of a passive eavesdropper. In the scheme, after general pilot signal transmissions at all nodes, each node broadcasts a weighted combination of its received signals with optimized coefficients, so that legitimate nodes can obtain the information of channels used for group key generation while the eavesdropper cannot. We also apply different quantization schemes for quantizing and encoding the estimated channels into keys. To provide detailed transmissions and processing steps of group key generation, we also describe the proposed scheme for 4-node mesh topology case. The simulation results show that the proposed scheme achieves a higher secret group key rate and a lower key disagreement rate than a benchmark scheme.

DOI
10.1109/glocom.2015.7417477

Related papers

Secret Group Key Generation in Physical Layer for Mesh Topology

Chan Dai Truyen Thai, Jemin Lee, Tony Q. S. Quek

Secret group key generation based on physical layer in wireless communications has a lot of practical applications. A few studies focused on the theoretical bounds of the secret key rate based on the sets of received signals rather than a particular secret key generation scheme. We propose a secret group key generation scheme for an arbitrary number of legitimate nodes, n, in mesh topology in the presence of a passive eavesdropper. In the scheme, after general pilot signal transmissions at all nodes, each node broadcasts a weighted combination of its received signals with optimized coefficients, so that legitimate nodes can obtain the information of channels used for group key generation while the eavesdropper cannot. We also apply different quantization schemes for quantizing and encoding the estimated channels into keys. To provide detailed transmissions and processing steps of group key generation, we also describe the proposed scheme for 4-node mesh topology case. The simulation results show that the proposed scheme achieves a higher secret group key rate and a lower key disagreement rate than a benchmark scheme.

Globecom•Dec 1, 2014•7 citations

Secret Group-Key Generation at Physical Layer for Multi-Antenna Mesh Topology

Chan Dai Truyen Thai, Jemin Lee, Jay Prakash +1 more

In this paper, we propose a secret group-key generation scheme in physical layer, where an arbitrary number of multi-antenna LNs (LN) exist in mesh topology with a multi-antenna passive eavesdropper. In the first phase of the scheme, pilot signals are transmitted from selected antennas of all nodes and each node estimates channels linked to it. In the second phase, each node sequentially broadcasts a weighted combination of the estimated channel information using selected coefficients. The other LNs can obtain the channel information used for group-key generation while the eavesdropper cannot. Each node then can generate a group key by quantizing and encoding the estimated channels into keys. We apply well-known quantization schemes, such as scalar and vector quantizations, and compare their performance. To further enhance the key-generation performance, we also provide how to determine the antennas at each node used for group-key generation and the coefficients used in the broadcast phase. The simulation results verify the performance of the proposed secret group-key generation scheme using various key-related metrics. We also verify the practical robustness of our scheme by implementing a testbed using universal software radio peripheral. After generating secret common key among three nodes, we also test it using the National Institute of Standards and Technology test suit. The generated key passes the test and it is random enough for communication secrecy.

IEEE Transactions on Information Forensics and Security•May 17, 2018•56 citations

Group secret key generation in physical layer, protocols and achievable rates

Tianyu Tang, Ting Jiang, Weixia Zou

The secret group key generation based on physical layer security and information theory security has attracted increasing research interest. In this paper, we propose a scheme to establish the secret group key with the cooperation of all the nodes. To ensure the security of the group communication, a protocol is proposed to implement the collaborative secret group key via circle network topology. We subsequently analyze the achievable theoretical upper bound of the secret group key rate for circle topology in the presence of an eavesdropper. The simulation result shows that the protocol doesn't only assign the computation and broadcast to each node, but also obviously increase the group key generation rate than a benchmark scheme. We further analyze the impact of node number and SNR on the achievable secrecy rate.

International Symposium on Communications and Information Technologies•Sep 1, 2017•6 citations

Fast and Efficient Physical Layer Secret Key Generation over Static Wireless Channels

Jie Tang, Ruifei Wang, Huan Song +1 more

Recently, shared secret key generation from wireless channel characteristics has attracted a lot of attention due to its low computational overhead. However, in a static environment, the secret key rate is relatively lower due to the lack of channel time-variation. In this paper, we propose a lightweight and efficient PLKG scheme for static channels. Different from current schemes, in the proposed scheme, the transmitter attaches the information of the secret key into the downlink pilot signals to the legitimate receiver by the proposed secret precoding. At the receiving end, the legitimate receiver can directly observe the correct information of secret key from the public downlink pilot signals, while keeping perfect secrecy of the generated key against eavesdroppers. The key principle lies in that the information of the secret key is coded in the index of the non-activated MIMO (multiple-input-multiple-output) sub-channel. Consequently, only the legitimate receiver can accurately observe the value of the key information. For any other eavesdroppers who suffer an independent channel from the legitimate transmitter and receiver, it is proven that she cannot observe any key information from her received signals. Therefore, the key rate can be improved for the static channels by increasing the symbol rate of the pilot signals. Simulations are conducted to validate the effectiveness of the proposed scheme.

IEEE International Conference on Computer and Communications (ICCC)•Dec 10, 2021•8 citations

Practical Physical-Layer Group Secret-Key Generation in Three-User Wireless Networks

Manish Rao, J. Harshan

Group secret-key (GSK) generation using temporal variation in wireless channels is an effective way of synthesizing symmetric keys across multiple nodes (more than two) in wireless networks. Unlike the case of two-node key-generation, GSK generation necessitates some nodes to act as facilitators by transmitting linear combinations of the channel realizations. However, in practice, radio devices are designed to transmit baseband signals from finite complex constellations. Due to such constraints, the linear combinations of channel realizations are typically quantized by the facilitator which in turn impacts the overall secret-key rate. Identifying this issue, we propose a practical GSK generation protocol in a network of three nodes. Under special conditions, we analytically show that the proposed method provides higher key-rate than the case when only the facilitator quantizes the channel realizations before transmission. Through simulations, we show that the proposed method yields higher key-rate than the baselines when the facilitator employs finite constellations such as 4-, 16-, and 64-QAM.

International Conference on Signal Processing and Communications (SPCOM)•Jul 1, 2018•4 citations

Group Secret Key Generation For Wireless Network

Rahul Kumar, Jaya Kumar

This paper by exploiting physical layer characteristics of wireless channel investigates group secret key generation problem for different types of wireless network.A new group key generation strategy with low complexity is proposed, which combines point to point pair-wise key generation technique, the multi-segment scheme and the onetime pad.This group key generation technique works for three types of communication networks: the three node network, the multi node ring and multi node mesh network.For these communication networks three group key generation algorithms are developed, the first two algorithms yield optimal group key rates while the third algorithm gives the optimal multiplexing gain.We address the time allocation problem in the channel estimation step to maximize the group key rate.A series of geometric programming, and a single condensation method based iterative algorithm is proposed in order to solve the non-convex max min problem.To validate the performance of the proposed key generation algorithm and the time allocation problem the numerical results are also been provided.

International Journal of MC Square Scientific Research•Apr 16, 2017•3 citations
Secret group key generation based on physical layer in wireless communications has a lot of practical applications. A few studies focused on the theoretical bounds of the secret key rate based on the sets of received signals rather than a particular secret key generation scheme. We propose a secret group key generation scheme for an arbitrary number of legitimate nodes, n, in mesh topology in the presence of a passive eavesdropper. In the scheme, after general pilot signal transmissions at all nodes, each node broadcasts a weighted combination of its received signals with optimized coefficients, so that legitimate nodes can obtain the information of channels used for group key generation while the eavesdropper cannot. We also apply different quantization schemes for quantizing and encoding the estimated channels into keys. To provide detailed transmissions and processing steps of group key generation, we also describe the proposed scheme for 4-node mesh topology case. The simulation results show that the proposed scheme achieves a higher secret group key rate and a lower key disagreement rate than a benchmark scheme.
Secret group key generation based on physical layer in wireless communications has a lot of practical applications. A few studies focused on the theoretical bounds of the secret key rate based on the sets of received signals rather than a particular secret key generation scheme. We propose a secret group key generation scheme for an arbitrary number of legitimate nodes, n, in mesh topology in the presence of a passive eavesdropper. In the scheme, after general pilot signal transmissions at all nodes, each node broadcasts a weighted combination of its received signals with optimized coefficients, so that legitimate nodes can obtain the information of channels used for group key generation while the eavesdropper cannot. We also apply different quantization schemes for quantizing and encoding the estimated channels into keys. To provide detailed transmissions and processing steps of group key generation, we also describe the proposed scheme for 4-node mesh topology case. The simulation results show that the proposed scheme achieves a higher secret group key rate and a lower key disagreement rate than a benchmark scheme.
In this paper, we propose a secret group-key generation scheme in physical layer, where an arbitrary number of multi-antenna LNs (LN) exist in mesh topology with a multi-antenna passive eavesdropper. In the first phase of the scheme, pilot signals are transmitted from selected antennas of all nodes and each node estimates channels linked to it. In the second phase, each node sequentially broadcasts a weighted combination of the estimated channel information using selected coefficients. The other LNs can obtain the channel information used for group-key generation while the eavesdropper cannot. Each node then can generate a group key by quantizing and encoding the estimated channels into keys. We apply well-known quantization schemes, such as scalar and vector quantizations, and compare their performance. To further enhance the key-generation performance, we also provide how to determine the antennas at each node used for group-key generation and the coefficients used in the broadcast phase. The simulation results verify the performance of the proposed secret group-key generation scheme using various key-related metrics. We also verify the practical robustness of our scheme by implementing a testbed using universal software radio peripheral. After generating secret common key among three nodes, we also test it using the National Institute of Standards and Technology test suit. The generated key passes the test and it is random enough for communication secrecy.
The secret group key generation based on physical layer security and information theory security has attracted increasing research interest. In this paper, we propose a scheme to establish the secret group key with the cooperation of all the nodes. To ensure the security of the group communication, a protocol is proposed to implement the collaborative secret group key via circle network topology. We subsequently analyze the achievable theoretical upper bound of the secret group key rate for circle topology in the presence of an eavesdropper. The simulation result shows that the protocol doesn't only assign the computation and broadcast to each node, but also obviously increase the group key generation rate than a benchmark scheme. We further analyze the impact of node number and SNR on the achievable secrecy rate.
Recently, shared secret key generation from wireless channel characteristics has attracted a lot of attention due to its low computational overhead. However, in a static environment, the secret key rate is relatively lower due to the lack of channel time-variation. In this paper, we propose a lightweight and efficient PLKG scheme for static channels. Different from current schemes, in the proposed scheme, the transmitter attaches the information of the secret key into the downlink pilot signals to the legitimate receiver by the proposed secret precoding. At the receiving end, the legitimate receiver can directly observe the correct information of secret key from the public downlink pilot signals, while keeping perfect secrecy of the generated key against eavesdroppers. The key principle lies in that the information of the secret key is coded in the index of the non-activated MIMO (multiple-input-multiple-output) sub-channel. Consequently, only the legitimate receiver can accurately observe the value of the key information. For any other eavesdroppers who suffer an independent channel from the legitimate transmitter and receiver, it is proven that she cannot observe any key information from her received signals. Therefore, the key rate can be improved for the static channels by increasing the symbol rate of the pilot signals. Simulations are conducted to validate the effectiveness of the proposed scheme.
Group secret-key (GSK) generation using temporal variation in wireless channels is an effective way of synthesizing symmetric keys across multiple nodes (more than two) in wireless networks. Unlike the case of two-node key-generation, GSK generation necessitates some nodes to act as facilitators by transmitting linear combinations of the channel realizations. However, in practice, radio devices are designed to transmit baseband signals from finite complex constellations. Due to such constraints, the linear combinations of channel realizations are typically quantized by the facilitator which in turn impacts the overall secret-key rate. Identifying this issue, we propose a practical GSK generation protocol in a network of three nodes. Under special conditions, we analytically show that the proposed method provides higher key-rate than the case when only the facilitator quantizes the channel realizations before transmission. Through simulations, we show that the proposed method yields higher key-rate than the baselines when the facilitator employs finite constellations such as 4-, 16-, and 64-QAM.
This paper by exploiting physical layer characteristics of wireless channel investigates group secret key generation problem for different types of wireless network.A new group key generation strategy with low complexity is proposed, which combines point to point pair-wise key generation technique, the multi-segment scheme and the onetime pad.This group key generation technique works for three types of communication networks: the three node network, the multi node ring and multi node mesh network.For these communication networks three group key generation algorithms are developed, the first two algorithms yield optimal group key rates while the third algorithm gives the optimal multiplexing gain.We address the time allocation problem in the channel estimation step to maximize the group key rate.A series of geometric programming, and a single condensation method based iterative algorithm is proposed in order to solve the non-convex max min problem.To validate the performance of the proposed key generation algorithm and the time allocation problem the numerical results are also been provided.