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 Journal of MC Square Scientific Research

Group Secret Key Generation For Wireless Network

Rahul Kumar, Jaya Kumar

Published Apr 16, 2017• 3 citations
Publisher

Abstract

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.

DOI
10.20894/ijmsr.117.009.001.031

Related papers

Group Secret Key Generation in Wireless Networks: Algorithms and Rate Optimization

Peng Xu, Kanapathippillai Cumanan, Zhiguo Ding +2 more

This paper investigates group secret key generation problems for different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A new group key generation strategy with low complexity is proposed, which combines the well-established point-to-point pairwise key generation technique, the multisegment scheme, and the one-time pad. In particular, this group key generation process is studied for three types of communication networks: 1) the three-node network; 2) the multinode ring network; and 3) the multinode mesh network. Three group key generation algorithms are developed for these communication networks, respectively. The analysis shows that the first two algorithms yield optimal group key rates, whereas the third algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address the time allocation problem in the channel estimation step to maximize the group key rates. This non-convex max-min time allocation problem is first reformulated into a series of geometric programming, and then, a single-condensation-method-based iterative algorithm is proposed. Numerical results are also provided to validate the performance of the proposed key generation algorithms and the time allocation algorithm.

IEEE Transactions on Information Forensics and Security•Apr 13, 2016•73 citations

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 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, 2015•28 citations

GROUP SECRET KEY GENERATION FOR 5G Networks

Ali M. Allam

Key establishment method based on channel reciprocity for time division duplex (TDD) system has earned a vital consideration in the majority of recent research.While most of the cellular systems rely on frequency division duplex (FDD) systems, especially the 5G network, which is not characterized by the channel reciprocity feature.This paper realizes the generation of a group secret key for multi-terminals communicated through a wireless network in FDD mode, by utilizing the nature of the physical layer for the wireless links between them.I consider a new group key generation approach, which using bitwise XOR with a modified pairwise secret key generation approach not based on the channel reciprocity feature.Precisely, this multi-node secret key agreement technique designed for three wireless network topologies: 1) the triangle topology, 2) the multi-terminal star topology, and 3) the multi-node chain topology.Three multi-node secret key agreement protocols suggest for these wireless communication topologies in FDD mode, respectively.I determine the upper bound for the generation rate of the secret key shared among multi-node, for the three multi-terminals topologies, and give numerical cases to expose the achievement of my offered technique.

KSII Transactions on Internet and Information Systems•Aug 31, 2019•0 citations

Scalable Group Secret Key Generation over Wireless Channels

Ufuk Altun, Semiha Tedik Başaran, Güneş Karabulut Kurt +1 more

In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against eavesdroppers. With the help of the physical layer security techniques, users can securely decide on a secret key without a trusted party by exploiting the unique properties of the channel. In this context, we develop a physical layer group key generation scheme that is also based on the ideas of the analog function computation studies. We firstly consider the key generation as a function to be computed over the wireless channel and propose two novel methods depending on the users transmission capability (i.e. half-duplex and full-duplex transmissions). Secondly, we exploit the uniqueness of the prime integers in order to enable the simultaneous transmission of the users for key generation. As a result, our approach contributes to the scalability of the existing physical layer key generation algorithms since all users transmit simultaneously rather than using pairwise communications. We prove that our half-duplex network model reduces the required number of communications for group key generation down to a linear scale. Furthermore, the full-duplex network model reduces to a constant scale.

arXiv:1912.07331•Dec 16, 2019•0 citations

An Efficient Group Secret Key Generation Scheme for Wireless Sensor Network

Jiaqi Xiong, Xin Zeng, Xiaoping Xue +1 more

The Internet of Things technology is one of the important directions of Smart Grid research, involving many wireless sensors and communication facilities, and has high requirements for security. The physical layer security technology can effectively solve the security problems under wireless communication. As the most common application scenario of wireless communication is multi-node wireless network communication, group secret key (GSK) based on physical layer security and information theory security is gradually attracting investigator’s interest. In this paper, a novel physical layer GSK generation scheme based on code-domain exchange of channel information in mesh network is proposed. Instead of traditional side-information exchange in symbol-domain, error-correcting code is applied to finish information exchange and reconciliation simultaneously in code-domain. Each node processes the known channel bit sequence and then encodes it to generate a check sequence. After broadcasting the check bit sequence to other nodes, each node decodes the received check bit sequences to obtained the unknown channel information. The simulation results show that the scheme can effectively reduce the times of information exchanges while keeping a good performance including low bit error rate and low block error rate.

International Conference on Wireless Communications and Smart Grid (ICWCSG)•Aug 1, 2021•0 citations
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.
This paper investigates group secret key generation problems for different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A new group key generation strategy with low complexity is proposed, which combines the well-established point-to-point pairwise key generation technique, the multisegment scheme, and the one-time pad. In particular, this group key generation process is studied for three types of communication networks: 1) the three-node network; 2) the multinode ring network; and 3) the multinode mesh network. Three group key generation algorithms are developed for these communication networks, respectively. The analysis shows that the first two algorithms yield optimal group key rates, whereas the third algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address the time allocation problem in the channel estimation step to maximize the group key rates. This non-convex max-min time allocation problem is first reformulated into a series of geometric programming, and then, a single-condensation-method-based iterative algorithm is proposed. Numerical results are also provided to validate the performance of the proposed key generation algorithms and the time allocation algorithm.
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.
Key establishment method based on channel reciprocity for time division duplex (TDD) system has earned a vital consideration in the majority of recent research.While most of the cellular systems rely on frequency division duplex (FDD) systems, especially the 5G network, which is not characterized by the channel reciprocity feature.This paper realizes the generation of a group secret key for multi-terminals communicated through a wireless network in FDD mode, by utilizing the nature of the physical layer for the wireless links between them.I consider a new group key generation approach, which using bitwise XOR with a modified pairwise secret key generation approach not based on the channel reciprocity feature.Precisely, this multi-node secret key agreement technique designed for three wireless network topologies: 1) the triangle topology, 2) the multi-terminal star topology, and 3) the multi-node chain topology.Three multi-node secret key agreement protocols suggest for these wireless communication topologies in FDD mode, respectively.I determine the upper bound for the generation rate of the secret key shared among multi-node, for the three multi-terminals topologies, and give numerical cases to expose the achievement of my offered technique.
In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against eavesdroppers. With the help of the physical layer security techniques, users can securely decide on a secret key without a trusted party by exploiting the unique properties of the channel. In this context, we develop a physical layer group key generation scheme that is also based on the ideas of the analog function computation studies. We firstly consider the key generation as a function to be computed over the wireless channel and propose two novel methods depending on the users transmission capability (i.e. half-duplex and full-duplex transmissions). Secondly, we exploit the uniqueness of the prime integers in order to enable the simultaneous transmission of the users for key generation. As a result, our approach contributes to the scalability of the existing physical layer key generation algorithms since all users transmit simultaneously rather than using pairwise communications. We prove that our half-duplex network model reduces the required number of communications for group key generation down to a linear scale. Furthermore, the full-duplex network model reduces to a constant scale.
The Internet of Things technology is one of the important directions of Smart Grid research, involving many wireless sensors and communication facilities, and has high requirements for security. The physical layer security technology can effectively solve the security problems under wireless communication. As the most common application scenario of wireless communication is multi-node wireless network communication, group secret key (GSK) based on physical layer security and information theory security is gradually attracting investigator’s interest. In this paper, a novel physical layer GSK generation scheme based on code-domain exchange of channel information in mesh network is proposed. Instead of traditional side-information exchange in symbol-domain, error-correcting code is applied to finish information exchange and reconciliation simultaneously in code-domain. Each node processes the known channel bit sequence and then encodes it to generate a check sequence. After broadcasting the check bit sequence to other nodes, each node decodes the received check bit sequences to obtained the unknown channel information. The simulation results show that the scheme can effectively reduce the times of information exchanges while keeping a good performance including low bit error rate and low block error rate.