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

Journal of Communications Technology and Electronics

Power Allocation under Given Secret Key Generation Rate for Secure Wireless OFDM Systems

Amir Aliabadian, Mohammad Reza Zahabi, Majid Mobini

Published May 1, 2023• 2 citations
Publisher

Abstract

Abstract Generating a secret key from the physical layer is one of the most challenging topics in cryptography. Secret key generation rate (SKGR) and secrecy rate (SR) are two important concepts for any secure communication scheme. In this paper, we first propose a new power allocation strategy to minimize the power consumption under a given SKGR constraint for orthogonal frequency division (OFDM) based communication systems. Due to the non-convex nature of the SKGR expression, we convert the optimization problem into a convex problem. In the continuation of this paper, we investigate the effects of the proposed power allocation strategy on the SR performance. Simulation results demonstrate that using the obtained optimum power vector, which was calculated in the key generation phase, we achieve a better level of SR in the data communication phase. The simulation results also verify that the average SR performance obtained by the proposed method is superior to the geometric programing (GP)-based method.

DOI
10.1134/s1064226923050017

Related papers

Increasing secret key capacity of OFDM systems: a geometric program approach

Longwang Cheng, Wei Li, Li Zhou +3 more

Summary Extracting secret keys from the common randomness of wireless channels has attracted prominent attention recently. Orthogonal frequency‐division multiplexing (OFDM) systems can provide extra randomness in view of the use of multiple subchannels. So far, the secret key capacity of OFDM systems is still an open issue. In this paper, the secret key capacity of OFDM systems based on the subchannel state information is analyzed, and an expression of the secret key capacity is derived under the assumption that the subchannels are independent. To increase the secret key capacity, a power allocation scheme based on geometric program is proposed. Furthermore, an underlying propagation protocol is designed to realize the power allocation scheme. Performance simulations show that the proposed scheme achieves greater secret key capacity in comparison with equal power allocation scheme, especially at low signal‐to‐noise ratio region. Besides, the secret key bits mismatch rate during the secret key generation based on the power allocated subchannels is decreased.

Concurrency and Computation Practice and Experience•Sep 23, 2016•5 citations

Scramble-Based Secret Key Generation Algorithm in Physical Layer Security

Dan Wang, Feng Chen, Yongtai Chen +2 more

As a new way to enhance wireless communication security, secret key generation based on physical layer channel characteristics has emerged. In this paper, we propose a novel secret key generation algorithm based on wireless channel characteristics for orthogonal frequency division multiplexing (OFDM) communication systems. The mean quantization algorithm is applied to quantize the real part and imaginary part of OFDM subcarriers, respectively, which can significantly increase the length of the generated secret key in the OFDM system. To reduce the consistency between the secret keys generated by the eavesdropper and the legitimate communication nodes, a processing method by taking the subcarrier phase as initialization of a scrambling code and scrambling the quantized result is proposed. The simulation and test results show that compared with the existing research, the proposed algorithm can improve the key generation rate (KGR), reduce the key mismatch rate (KMR) and complexity, maintain high randomness, and disturb the eavesdroppers.

Mobile Information Systems•Oct 4, 2022•1 citation

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

A New Scheme for Improving Channel-Based Secret Key Generation Rates

Jehad M. Hamamreh, Haji Muhammad Furqan

Physical layer key generation from the wireless channel is an emerging area of interest to provide confidentiality and authentication. One of the main challenges in this domain is to increase the length of the generated secret key while maintaining its randomness and uniformity. In this letter, new dimensions for wireless channel-based key generation are proposed for orthogonal frequency division multiplexing (OFDM) systems. The novel perspective of the proposed work lies in the generation of key bits not only from the magnitudes of OFDM subchannels as it has conventionally been done but also from the number and positions/indices of those subchannels, whose channel gains are above the mean of the respective subblock. The effectiveness of the proposed algorithms is evaluated in terms of key generation rate and key mismatch rate. It is shown in the simulation results that the involvement of the proposed dimensions can double the key generation rate compared to conventional algorithms.

IEEE Wireless Communications Letters•Sep 6, 2024•3 citations

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 Key Generation Using OFDM Samples

Shantnu Kakkar, Inderpreet Singh Makkar, Amar Kumar Mohapatra

Information is regarded as a resource with highest organizational value. Its confidentiality, integrity and authenticity are important for any organization. The broadcast nature of wireless medium makes communication vulnerable to security attacks such as eavesdropping, non-repudiation, denial of service and more. Hence, prior to transmission of information, a secret key is securely exchanged between sender and receiver. Conventional key generation algorithms work at the application layer. However, they suffer from computational overheads and require a reliable third party. Moreover, when system grows complex, these methods start failing considerably. To encounter these issues, a novel key exchange mechanism is proposed which works at the physical layer. The proposed method is based on the concept of self-jamming and exploits the properties of Orthogonal Frequency Division Multiplexing (OFDM). The simulation results show that the proposed scheme has a low Bit Error Rate (BER) for the receiver and high BER for the eavesdropper. It has also been shown that the number of attempts that eavesdropper has to make to guess the correct key are large, thereby decreasing its probability to decode the correct key.

Journal of Discrete Mathematical Sciences and Cryptography•Jun 22, 2015•7 citations
Abstract Generating a secret key from the physical layer is one of the most challenging topics in cryptography. Secret key generation rate (SKGR) and secrecy rate (SR) are two important concepts for any secure communication scheme. In this paper, we first propose a new power allocation strategy to minimize the power consumption under a given SKGR constraint for orthogonal frequency division (OFDM) based communication systems. Due to the non-convex nature of the SKGR expression, we convert the optimization problem into a convex problem. In the continuation of this paper, we investigate the effects of the proposed power allocation strategy on the SR performance. Simulation results demonstrate that using the obtained optimum power vector, which was calculated in the key generation phase, we achieve a better level of SR in the data communication phase. The simulation results also verify that the average SR performance obtained by the proposed method is superior to the geometric programing (GP)-based method.
Summary Extracting secret keys from the common randomness of wireless channels has attracted prominent attention recently. Orthogonal frequency‐division multiplexing (OFDM) systems can provide extra randomness in view of the use of multiple subchannels. So far, the secret key capacity of OFDM systems is still an open issue. In this paper, the secret key capacity of OFDM systems based on the subchannel state information is analyzed, and an expression of the secret key capacity is derived under the assumption that the subchannels are independent. To increase the secret key capacity, a power allocation scheme based on geometric program is proposed. Furthermore, an underlying propagation protocol is designed to realize the power allocation scheme. Performance simulations show that the proposed scheme achieves greater secret key capacity in comparison with equal power allocation scheme, especially at low signal‐to‐noise ratio region. Besides, the secret key bits mismatch rate during the secret key generation based on the power allocated subchannels is decreased.
As a new way to enhance wireless communication security, secret key generation based on physical layer channel characteristics has emerged. In this paper, we propose a novel secret key generation algorithm based on wireless channel characteristics for orthogonal frequency division multiplexing (OFDM) communication systems. The mean quantization algorithm is applied to quantize the real part and imaginary part of OFDM subcarriers, respectively, which can significantly increase the length of the generated secret key in the OFDM system. To reduce the consistency between the secret keys generated by the eavesdropper and the legitimate communication nodes, a processing method by taking the subcarrier phase as initialization of a scrambling code and scrambling the quantized result is proposed. The simulation and test results show that compared with the existing research, the proposed algorithm can improve the key generation rate (KGR), reduce the key mismatch rate (KMR) and complexity, maintain high randomness, and disturb the eavesdroppers.
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.
Physical layer key generation from the wireless channel is an emerging area of interest to provide confidentiality and authentication. One of the main challenges in this domain is to increase the length of the generated secret key while maintaining its randomness and uniformity. In this letter, new dimensions for wireless channel-based key generation are proposed for orthogonal frequency division multiplexing (OFDM) systems. The novel perspective of the proposed work lies in the generation of key bits not only from the magnitudes of OFDM subchannels as it has conventionally been done but also from the number and positions/indices of those subchannels, whose channel gains are above the mean of the respective subblock. The effectiveness of the proposed algorithms is evaluated in terms of key generation rate and key mismatch rate. It is shown in the simulation results that the involvement of the proposed dimensions can double the key generation rate compared to conventional algorithms.
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.
Information is regarded as a resource with highest organizational value. Its confidentiality, integrity and authenticity are important for any organization. The broadcast nature of wireless medium makes communication vulnerable to security attacks such as eavesdropping, non-repudiation, denial of service and more. Hence, prior to transmission of information, a secret key is securely exchanged between sender and receiver. Conventional key generation algorithms work at the application layer. However, they suffer from computational overheads and require a reliable third party. Moreover, when system grows complex, these methods start failing considerably. To encounter these issues, a novel key exchange mechanism is proposed which works at the physical layer. The proposed method is based on the concept of self-jamming and exploits the properties of Orthogonal Frequency Division Multiplexing (OFDM). The simulation results show that the proposed scheme has a low Bit Error Rate (BER) for the receiver and high BER for the eavesdropper. It has also been shown that the number of attempts that eavesdropper has to make to guess the correct key are large, thereby decreasing its probability to decode the correct key.