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 Wireless Communications and Mobile Computing Conference (IWCMC)

Channel secondary random process for robust secret key generation

Ahmed Badawy, Tamer M. Khattab, Tarek Elfouly, Carla Fabiana Chiasserini, Amr Mahmoud Salem Mohamed, Daniele Trinchero

Published Aug 1, 2015• 3 citations
Publisher

Abstract

The broadcast nature of wireless communications imposes the risk of information leakage to adversarial users or unauthorized receivers. Therefore, information security between intended users remains a challenging issue. Most of the current physical layer security techniques exploit channel randomness as a common source between two legitimate nodes to extract a secret key. In this paper, we propose a new simple technique to generate the secret key. Specifically, we exploit the estimated channel to generate a secondary random process (SRP) that is common between the two legitimate nodes. We compare the estimated channel gain and phase to a preset threshold. The moving differences between the locations at which the estimated channel gain and phase exceed the threshold are the realization of our SRP. We simulate an orthogonal frequency division multiplexing (OFDM) system and show that our proposed technique provides a drastic improvement in the key bit mismatch rate (BMR) between the legitimate nodes when compared to the techniques that exploit the estimated channel gain or phase directly. In addition to that, the secret key generated through our technique is longer than that generated by conventional techniques.

DOI
10.1109/iwcmc.2015.7289067

Related papers

Robust secret key extraction from channel secondary random process

Ahmed Badawy, Tarek Elfouly, Tamer M. Khattab +3 more

Abstract The vast majority of existing secret key generation protocols exploit the inherent randomness of the wireless channel as a common source of randomness. However, independent noise added at the receivers of the legitimate nodes affects the reciprocity of the channel. In this paper, we propose a new simple technique to generate the secret key that mitigates the effect of noise. Specifically, we exploit the estimated channel to generate a secondary random process (SRP) that is common between the two legitimate nodes. We compare the estimated channel gain and phase to a preset threshold. The moving differences between the locations at which the estimated channel gain and phase exceed the threshold are the realization of our SRP. We study the properties of our generated SRP and derive a closed form expression for the probability mass function of the realizations of our SRP. We simulate an orthogonal frequency division multiplexing system and show that our proposed technique provides a drastic improvement in the key bit mismatch rate between the legitimate nodes when compared with the techniques that exploit the estimated channel gain or phase directly. In addition to that, the secret key generated through our technique is longer than that generated by conventional techniques. Moreover, we compute the conditional probabilities used to estimate the secret key capacity. Copyright © 2016 John Wiley & Sons, Ltd.

Wireless Communications and Mobile Computing•Jun 22, 2016•8 citations

Secret Key Generation Based on AoA Estimation for Low SNR Conditions

Ahmed Badawy, Tamer M. Khattab, Tarek Elfouly +3 more

In the context of physical layer security, a physical layer characteristic is used as a common source of randomness to generate the secret key. Therefore an accurate estimation of this characteristic is the core for reliable secret key generation. Estimation of almost all the existing physical layer characteristic suffer dramatically at low signal to noise (SNR) levels. In this paper, we propose a novel secret key generation algorithm that is based on the estimated angle of arrival (AoA) between the two legitimate nodes. Our algorithm has an outstanding performance at very low SNR levels. Our algorithm can exploit either the Azimuth AoA to generate the secret key or both the Azimuth and Elevation angles to generate the secret key. Exploiting a second common source of randomness adds an extra degree of freedom to the performance of our algorithm. We compare the performance of our algorithm to the algorithm that uses the most commonly used characteristics of the physical layer which are channel amplitude and phase. We show that our algorithm has a very low bit mismatch rate (BMR) at very low SNR when both channel amplitude and phase based algorithm fail to achieve an acceptable BMR.

IEEE Vehicular Technology Conference•May 1, 2015•30 citations

Secret Key Generation Based on AoA Estimation for Low SNR Conditions

Ahmed Badawy, Tamer M. Khattab, Tarek Elfouly +3 more

In the context of physical layer security, a physical layer characteristic is used as a common source of randomness to generate the secret key. Therefore an accurate estimation of this characteristic is the core for reliable secret key generation. Estimation of almost all the existing physical layer characteristic suffer dramatically at low signal to noise (SNR) levels. In this paper, we propose a novel secret key generation algorithm that is based on the estimated angle of arrival (AoA) between the two legitimate nodes. Our algorithm has an outstanding performance at very low SNR levels. Our algorithm can exploit either the Azimuth AoA to generate the secret key or both the Azimuth and Elevation angles to generate the secret key. Exploiting a second common source of randomness adds an extra degree of freedom to the performance of our algorithm. We compare the performance of our algorithm to the algorithm that uses the most commonly used characteristics of the physical layer which are channel amplitude and phase. We show that our algorithm has a very low bit mismatch rate (BMR) at very low SNR when both channel amplitude and phase based algorithm fail to achieve an acceptable BMR.

arXiv:1411.2208•Nov 9, 2014•0 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

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

Efficient Key Generation by Exploiting Randomness From Channel Responses of Individual OFDM Subcarriers

Junqing Zhang, Alan Marshall, Roger Woods +1 more

Key generation from the randomness of wireless channels is a promising technique to establish a secret cryptographic key securely between legitimate users. This paper proposes a new approach to extract keys efficiently from the channel responses of individual orthogonal frequency-division multiplexing (OFDM) subcarriers. The efficiency is achieved by: 1) fully exploiting randomness from time and frequency domains and 2) improving the cross-correlation of the channel measurements. Through the theoretical modeling of the time and frequency autocorrelation relationship of the OFDM subcarrier's channel responses, we can obtain the optimal probing rate and use multiple uncorrelated subcarriers as random sources. We also study the effects of non-simultaneous measurements and noise on the cross-correlation of the channel measurements. We find that the cross-correlation is mainly impacted by noise effects in a slow fading channel and use a low-pass filter to reduce the key disagreement rate and extend the system's working signal-to-noise ratio range. The system is evaluated in terms of randomness, key generation rate, and key disagreement rate, verifying that it is feasible to extract randomness from both time and frequency domains of the OFDM subcarrier's channel responses.

IEEE Transactions on Communications•Apr 7, 2016•137 citations
The broadcast nature of wireless communications imposes the risk of information leakage to adversarial users or unauthorized receivers. Therefore, information security between intended users remains a challenging issue. Most of the current physical layer security techniques exploit channel randomness as a common source between two legitimate nodes to extract a secret key. In this paper, we propose a new simple technique to generate the secret key. Specifically, we exploit the estimated channel to generate a secondary random process (SRP) that is common between the two legitimate nodes. We compare the estimated channel gain and phase to a preset threshold. The moving differences between the locations at which the estimated channel gain and phase exceed the threshold are the realization of our SRP. We simulate an orthogonal frequency division multiplexing (OFDM) system and show that our proposed technique provides a drastic improvement in the key bit mismatch rate (BMR) between the legitimate nodes when compared to the techniques that exploit the estimated channel gain or phase directly. In addition to that, the secret key generated through our technique is longer than that generated by conventional techniques.
Abstract The vast majority of existing secret key generation protocols exploit the inherent randomness of the wireless channel as a common source of randomness. However, independent noise added at the receivers of the legitimate nodes affects the reciprocity of the channel. In this paper, we propose a new simple technique to generate the secret key that mitigates the effect of noise. Specifically, we exploit the estimated channel to generate a secondary random process (SRP) that is common between the two legitimate nodes. We compare the estimated channel gain and phase to a preset threshold. The moving differences between the locations at which the estimated channel gain and phase exceed the threshold are the realization of our SRP. We study the properties of our generated SRP and derive a closed form expression for the probability mass function of the realizations of our SRP. We simulate an orthogonal frequency division multiplexing system and show that our proposed technique provides a drastic improvement in the key bit mismatch rate between the legitimate nodes when compared with the techniques that exploit the estimated channel gain or phase directly. In addition to that, the secret key generated through our technique is longer than that generated by conventional techniques. Moreover, we compute the conditional probabilities used to estimate the secret key capacity. Copyright © 2016 John Wiley & Sons, Ltd.
In the context of physical layer security, a physical layer characteristic is used as a common source of randomness to generate the secret key. Therefore an accurate estimation of this characteristic is the core for reliable secret key generation. Estimation of almost all the existing physical layer characteristic suffer dramatically at low signal to noise (SNR) levels. In this paper, we propose a novel secret key generation algorithm that is based on the estimated angle of arrival (AoA) between the two legitimate nodes. Our algorithm has an outstanding performance at very low SNR levels. Our algorithm can exploit either the Azimuth AoA to generate the secret key or both the Azimuth and Elevation angles to generate the secret key. Exploiting a second common source of randomness adds an extra degree of freedom to the performance of our algorithm. We compare the performance of our algorithm to the algorithm that uses the most commonly used characteristics of the physical layer which are channel amplitude and phase. We show that our algorithm has a very low bit mismatch rate (BMR) at very low SNR when both channel amplitude and phase based algorithm fail to achieve an acceptable BMR.
In the context of physical layer security, a physical layer characteristic is used as a common source of randomness to generate the secret key. Therefore an accurate estimation of this characteristic is the core for reliable secret key generation. Estimation of almost all the existing physical layer characteristic suffer dramatically at low signal to noise (SNR) levels. In this paper, we propose a novel secret key generation algorithm that is based on the estimated angle of arrival (AoA) between the two legitimate nodes. Our algorithm has an outstanding performance at very low SNR levels. Our algorithm can exploit either the Azimuth AoA to generate the secret key or both the Azimuth and Elevation angles to generate the secret key. Exploiting a second common source of randomness adds an extra degree of freedom to the performance of our algorithm. We compare the performance of our algorithm to the algorithm that uses the most commonly used characteristics of the physical layer which are channel amplitude and phase. We show that our algorithm has a very low bit mismatch rate (BMR) at very low SNR when both channel amplitude and phase based algorithm fail to achieve an acceptable BMR.
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.
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.
Key generation from the randomness of wireless channels is a promising technique to establish a secret cryptographic key securely between legitimate users. This paper proposes a new approach to extract keys efficiently from the channel responses of individual orthogonal frequency-division multiplexing (OFDM) subcarriers. The efficiency is achieved by: 1) fully exploiting randomness from time and frequency domains and 2) improving the cross-correlation of the channel measurements. Through the theoretical modeling of the time and frequency autocorrelation relationship of the OFDM subcarrier's channel responses, we can obtain the optimal probing rate and use multiple uncorrelated subcarriers as random sources. We also study the effects of non-simultaneous measurements and noise on the cross-correlation of the channel measurements. We find that the cross-correlation is mainly impacted by noise effects in a slow fading channel and use a low-pass filter to reduce the key disagreement rate and extend the system's working signal-to-noise ratio range. The system is evaluated in terms of randomness, key generation rate, and key disagreement rate, verifying that it is feasible to extract randomness from both time and frequency domains of the OFDM subcarrier's channel responses.