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/ACM Transactions on Networking

Limitations of Generating a Secret Key Using Wireless Fading Under Active Adversary

Murtaza Abbasali Zafer, Dakshi Agrawal, Mudhakar Srivatsa

Published Jan 25, 2012• 55 citations
Publisher

Abstract

Recently, many research studies have explored the use of wireless fading to generate an information-theoretic shared secret key over an open wireless channel. While this line of research is now mature enough to be built into demonstrative working systems for scenarios involving a (limited) passive/eavesdropping adversary model, the case of an active (jamming) adversary has not been sufficiently studied. Under an active adversary, information-bits that need to be exchanged during the process of key setup will not only be subject to eavesdropping, but also message disruptions that could lead to a high communication cost per bit of secret key generated. Measuring efficiency of key exchange as the ratio of communication cost to the size of secret key generated, in this paper, we address the following question: Is generating a secret key by exploiting wireless fading an efficient process? We obtain analytical results that quantify the minimum number of information-bits that must be exchanged to obtain one bit of shared secret key and show that this number rapidly increases with an active adversary's signal power. Thus, through our analysis, we conclude that the effectiveness of generating a secret key from wireless fading is limited when considering active adversaries.

DOI
10.1109/tnet.2012.2183146

Related papers

A note on information-theoretic secret key exchange over wireless channels

Murtaza Abbasali Zafer, Dakshi Agrawal, Mudhakar Srivatsa

For wireless channels, a number of information-theoretic secret key exchange protocols have been proposed and analyzed for their efficiency in the literature. We contend that for such protocols in a realistic adversarial model that includes an active adversary, average number of message-bits that need to be exchanged to obtain one-bit of secret key is an important performance metric, which has been previously overlooked in the literature. Using this insight, we analytically study a recently popular class of information-theoretic secret key exchange protocols that is based on wireless channel fading. We obtain analytical results for specific cases and provide fundamental insights into the competitive performance of this class of information-theoretic secret key exchange protocols.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2009•6 citations

Secret key generation exploiting channel characteristics in wireless communications

Kui Ren, Hai Su, Qian Wang

Due to the broadcast nature of wireless channels, wireless communication is vulnerable to eavesdropping, message modification, and node impersonation. Securing the wireless communication requires the shared secret keys between the communicating entities. Traditional security schemes rely on public key infrastructures and cryptographic algorithms to manage secret keys. Recently, many physical-layer-based methods have been proposed as alternative solutions for key generation in wireless networks. These methods exploit the inherent randomness of the wireless fading channel to generate secret keys while providing information-theoretical security without intensive cryptographic computations. This article provides an overview of the existing PHY-based key generation schemes exploiting the randomness of the wireless channels. Specifically, we first introduce the fundamental and general framework of the PHY-based key generation schemes and then categorize them into two classes: received-signal-strength-based and channel- phase-based protocols. Finally, we present a performance comparison of them in terms of key disagreement probability, key generation rate, key bit randomness, scalability, and implementation issues.

IEEE Wireless Communications•Aug 1, 2011•261 citations

A secret key establishment in frequency division duplex communication systems under active attacker

Ali M. Allam

Most of the current research on generating a secret key from wireless fading channels relies on the channel reciprocity feature of the time division duplex link between legitimate entities so that they can acquire related information from the joint wireless connection. This paper investigates the challenge of generating a shared secret key in frequency division duplex communication systems, in which there is no reciprocity between the two nodes, in the presence of an active opponent. We suggest a key generation algorithm that depends on the product of two fading coefficients. We additionally look at the effects of an interfering adversary on the suggested key establishment scheme and solve the problem of evaluating the key rate for a scheme depending on virtual channel gain. We illustrate an adversary model using an optimal attacking strategy to minimize the rate of generating a shared secret key for our suggested algorithm. Additionally, we identify the suitable channel conditions for the non‐zero rate in the existence of an interfering adversary using simulation results.

Security and Privacy•Sep 1, 2018•1 citation

Information-Theoretically Secret Key Generation for Fading Wireless Channels

Chunxuan Ye, Suhas Mathur, Alex Reznik +3 more

The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time, and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical WiFi channel that reliable secret key establishment can be accomplished at rates on the order of 10 b/s.

arXiv:0910.5027•IEEE Transactions on Information Forensics and Security•Mar 2, 2010•420 citations

Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks

Kai Zeng, Daniel Wu, An Chan +1 more

Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on single-antenna systems. Multiple-antenna devices have the potential to provide more randomness for key generation than single-antenna ones. However, the performance of key generation using multiple-antenna devices in a real environment remains unknown. Different from the previous theoretical work on multiple-antenna key generation, we propose and implement a shared secret key generation protocol, Multiple-Antenna KEy generator (MAKE) using off-the-shelf 802.11n multiple-antenna devices. We also conduct extensive experiments and analysis in real indoor and outdoor mobile environments. Using the shared randomness extracted from measured Received Signal Strength Indicator (RSSI) to generate keys, our experimental results show that using laptops with three antennas, MAKE can increase the bit generation rate by more than four times over single-antenna systems. Our experiments validate the effectiveness of using multi-level quantization when there is enough mutual information in the channel. Our results also show the trade-off between bit generation rate and bit agreement ratio when using multi-level quantization. We further find that even if an eavesdropper has multiple antennas, she cannot gain much more information about the legitimate channel.

IEEE Conference on Computer Communications (INFOCOM)•Mar 1, 2010•244 citations

On the effectiveness of secret key extraction from wireless signal strength in real environments

Suman Jana, Sriram N. Premnath, Mike Clark +3 more

We evaluate the effectiveness of secret key extraction, for private communication between two wireless devices, from the received signal strength (RSS) variations on the wireless channel between the two devices. We use real world measurements of RSS in a variety of environments and settings. Our experimental results show that (i) in certain environments, due to lack of variations in the wireless channel, the extracted bits have very low entropy making these bits unsuitable for a secret key, (ii) an adversary can cause predictable key generation in these static environments, and (iii) in dynamic scenarios where the two devices are mobile, and/or where there is a significant movement in the environment, high entropy bits are obtained fairly quickly. Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive lossy quantizer in conjunction with Cascade-based information reconciliation [7] and privacy amplification [14]. Our measurements show that our scheme, in comparison to the existing ones that we evaluate, performs the best in terms of generating high entropy bits at a high bit rate. The secret key bit streams generated by our scheme also pass the randomness tests of the NIST test suite [21] that we conduct.

ACM Annual International Conference on Mobile Computing and Networking (MobiCom)•Sep 20, 2009•525 citations
Recently, many research studies have explored the use of wireless fading to generate an information-theoretic shared secret key over an open wireless channel. While this line of research is now mature enough to be built into demonstrative working systems for scenarios involving a (limited) passive/eavesdropping adversary model, the case of an active (jamming) adversary has not been sufficiently studied. Under an active adversary, information-bits that need to be exchanged during the process of key setup will not only be subject to eavesdropping, but also message disruptions that could lead to a high communication cost per bit of secret key generated. Measuring efficiency of key exchange as the ratio of communication cost to the size of secret key generated, in this paper, we address the following question: Is generating a secret key by exploiting wireless fading an efficient process? We obtain analytical results that quantify the minimum number of information-bits that must be exchanged to obtain one bit of shared secret key and show that this number rapidly increases with an active adversary's signal power. Thus, through our analysis, we conclude that the effectiveness of generating a secret key from wireless fading is limited when considering active adversaries.
For wireless channels, a number of information-theoretic secret key exchange protocols have been proposed and analyzed for their efficiency in the literature. We contend that for such protocols in a realistic adversarial model that includes an active adversary, average number of message-bits that need to be exchanged to obtain one-bit of secret key is an important performance metric, which has been previously overlooked in the literature. Using this insight, we analytically study a recently popular class of information-theoretic secret key exchange protocols that is based on wireless channel fading. We obtain analytical results for specific cases and provide fundamental insights into the competitive performance of this class of information-theoretic secret key exchange protocols.
Due to the broadcast nature of wireless channels, wireless communication is vulnerable to eavesdropping, message modification, and node impersonation. Securing the wireless communication requires the shared secret keys between the communicating entities. Traditional security schemes rely on public key infrastructures and cryptographic algorithms to manage secret keys. Recently, many physical-layer-based methods have been proposed as alternative solutions for key generation in wireless networks. These methods exploit the inherent randomness of the wireless fading channel to generate secret keys while providing information-theoretical security without intensive cryptographic computations. This article provides an overview of the existing PHY-based key generation schemes exploiting the randomness of the wireless channels. Specifically, we first introduce the fundamental and general framework of the PHY-based key generation schemes and then categorize them into two classes: received-signal-strength-based and channel- phase-based protocols. Finally, we present a performance comparison of them in terms of key disagreement probability, key generation rate, key bit randomness, scalability, and implementation issues.
Most of the current research on generating a secret key from wireless fading channels relies on the channel reciprocity feature of the time division duplex link between legitimate entities so that they can acquire related information from the joint wireless connection. This paper investigates the challenge of generating a shared secret key in frequency division duplex communication systems, in which there is no reciprocity between the two nodes, in the presence of an active opponent. We suggest a key generation algorithm that depends on the product of two fading coefficients. We additionally look at the effects of an interfering adversary on the suggested key establishment scheme and solve the problem of evaluating the key rate for a scheme depending on virtual channel gain. We illustrate an adversary model using an optimal attacking strategy to minimize the rate of generating a shared secret key for our suggested algorithm. Additionally, we identify the suitable channel conditions for the non‐zero rate in the existence of an interfering adversary using simulation results.
The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time, and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical WiFi channel that reliable secret key establishment can be accomplished at rates on the order of 10 b/s.
Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on single-antenna systems. Multiple-antenna devices have the potential to provide more randomness for key generation than single-antenna ones. However, the performance of key generation using multiple-antenna devices in a real environment remains unknown. Different from the previous theoretical work on multiple-antenna key generation, we propose and implement a shared secret key generation protocol, Multiple-Antenna KEy generator (MAKE) using off-the-shelf 802.11n multiple-antenna devices. We also conduct extensive experiments and analysis in real indoor and outdoor mobile environments. Using the shared randomness extracted from measured Received Signal Strength Indicator (RSSI) to generate keys, our experimental results show that using laptops with three antennas, MAKE can increase the bit generation rate by more than four times over single-antenna systems. Our experiments validate the effectiveness of using multi-level quantization when there is enough mutual information in the channel. Our results also show the trade-off between bit generation rate and bit agreement ratio when using multi-level quantization. We further find that even if an eavesdropper has multiple antennas, she cannot gain much more information about the legitimate channel.
We evaluate the effectiveness of secret key extraction, for private communication between two wireless devices, from the received signal strength (RSS) variations on the wireless channel between the two devices. We use real world measurements of RSS in a variety of environments and settings. Our experimental results show that (i) in certain environments, due to lack of variations in the wireless channel, the extracted bits have very low entropy making these bits unsuitable for a secret key, (ii) an adversary can cause predictable key generation in these static environments, and (iii) in dynamic scenarios where the two devices are mobile, and/or where there is a significant movement in the environment, high entropy bits are obtained fairly quickly. Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive lossy quantizer in conjunction with Cascade-based information reconciliation [7] and privacy amplification [14]. Our measurements show that our scheme, in comparison to the existing ones that we evaluate, performs the best in terms of generating high entropy bits at a high bit rate. The secret key bit streams generated by our scheme also pass the randomness tests of the NIST test suite [21] that we conduct.