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 Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

A secret key negotiation scheme for wireless communications over fading channels

Nana Zhang, Hongwen Yang

Published Aug 1, 2015• 1 citation
Publisher

Abstract

Due to the openness and broadcast nature of wireless mediums, wireless communication is always vulnerable to potential security threats such as eavesdropping, since unauthorized receiving is facilitated through wireless channels. This paper proposes a secret key negotiation scheme based on the difference of the packet loss. In a wireless channel, the packet losses at the intended receiver and the eavesdropper are statistically independent due to the independence of the thermal noise and the channel fading. The proposed scheme has exploited this feature in negotiating a secret key between Alice and Bob. Simulation results show that the proposed secret key negotiation scheme can effectively guarantee the security of wireless communications even if Eve is very close to Alice or Bob.

DOI
10.1109/fskd.2015.7382267

Related papers

An Opportunistic Physical-layer Approach to Secure Wireless Communications

Matthieu R. Bloch, João Barros, Miguel R. D. Rodrigues +1 more

Recent theoretical and practical work has shown that physical layer security techniques have the potential to significantly strengthen the security of wireless networks.We propose a practical security scheme by which two terminals (say Alice and Bob) are able to exploit the randomness of wireless fading channels to exchange data in an informationtheoretically secure way.To ensure that a potential eavesdropper (say Eve) is unable to decode any useful information, Alice sends useful symbols to Bob only when the instantaneous secrecy capacity is strictly positive.In the remaining time, a specially designed class of LDPC codes is used for reconciliation, thus allowing the extraction of a secret key, which can be distilled using privacy amplification.We believe this opportunistic approach can be used effectively as a physical layer complement to existing cryptographic protocols.

•Sep 27, 2006•0 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

Everlasting secrecy in disadvantaged wireless environments against sophisticated eavesdroppers

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. Our main interest is in the disadvantaged wireless environment, where the channel from the transmitter Alice to the eavesdropper Eve is (possibly much) better than that from Alice to Bob, hence making information-theoretic secrecy challenging. We present a method to exploit inherent vulnerabilities of the eavesdropper's receiver through the use of “cheap” cryptographically-secure key-bits, which only need be kept secret from Eve for the (short) transmission period of the message, to obtain information-theoretic (i.e. everlasting) secret bits at Bob. In particular, based on an ephemeral cryptographic key pre-shared between Alice and Bob, a random jamming signal with large variations is added to each symbol. The legitimate receiver Bob uses the key to subtract the jamming signal immediately, while Eve is forced to perform the inherently nonlinear operation of recording the signal; when Eve then obtains the key, which we assume pessimistically (for Alice) happens right after message transmission, Eve can then immediately subtract the jamming signal from the recorded signal. But, because of the intervening non-linear operation in Eve's receiver and the non-commutativity of nonlinear operations, Bob's channel and Eve's channel have different achievable rates and information-theoretic secrecy can be obtained, hence achieving the goal of converting the vulnerable cryptographic secret key into information-theoretic secure bits. The achievable secrecy rates for different settings are evaluated. Among other results, it is shown that, even when the eavesdropper has perfect access to the output of the transmitter (albeit through an imperfect analog-to-digital converter), the method can still achieve a positive secrecy rate.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2014•5 citations

Guaranteeing Secrecy in Wireless Networks using Artificial Noise

Satashu Goel

The broadcast nature of the wireless medium makes the communication over this medium vulnerable to eavesdropping. This report considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper. The assumption used is that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdropper. The transmitter ensures secrecy of communication by utilizing some of the available power to produce ‘artificial noise’, such that only the eavesdropper’s channel is degraded. Two scenarios are considered, one where the transmitter has multiple transmit antennas, and the other where amplifying relays simulate the effect of multiple antennas. The channel state information (CSI) is assumed to be publicly known, and hence, the secrecy of communication is independent of the secrecy of CSI.

•Jan 1, 2007•1 citation

Secret-key sharing based on layered broadcast coding over fading channels

Xiaojun Tang, Ruoheng Liu, Predrag Spasojević +1 more

A secret-key sharing strategy based on layered broadcast coding is introduced for slow fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from a passive eavesdropper, Eve. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow fading, and perfect channel state information (CSI) is assumed to be known only at the receivers during the transmission. Layered coding facilitates adapting the reliably decoded rate at Bob to the actual channel state without CSI available at Alice. The index of a reliably decoded layer is sent back to Alice via a public and error-free channel, which is exploited by Alice and Bob to generate the secret key. In this paper, the secrecy key rate is derived. In addition, the optimal power distribution over coded layers is characterized. It is shown that layered coding can increase the secrecy key rate significantly compared with single-level coding.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•9 citations

Guaranteeing Secrecy using Artificial Noise

Satashu Goel, Rohit Negi

The broadcast nature of the wireless medium makes the communication over this medium vulnerable to eavesdropping. This paper considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper. The assumption used is that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdropper. The transmitter ensures secrecy of communication by utilizing some of the available power to produce 'artificial noise', such that only the eavesdropper's channel is degraded. Two scenarios are considered, one where the transmitter has multiple transmit antennas, and the other where amplifying relays simulate the effect of multiple antennas. The channel state information (CSI) is assumed to be publicly known, and hence, the secrecy of communication is independent of the secrecy of CSI.

IEEE Transactions on Wireless Communications•Jun 1, 2008•1,930 citations
Due to the openness and broadcast nature of wireless mediums, wireless communication is always vulnerable to potential security threats such as eavesdropping, since unauthorized receiving is facilitated through wireless channels. This paper proposes a secret key negotiation scheme based on the difference of the packet loss. In a wireless channel, the packet losses at the intended receiver and the eavesdropper are statistically independent due to the independence of the thermal noise and the channel fading. The proposed scheme has exploited this feature in negotiating a secret key between Alice and Bob. Simulation results show that the proposed secret key negotiation scheme can effectively guarantee the security of wireless communications even if Eve is very close to Alice or Bob.
Recent theoretical and practical work has shown that physical layer security techniques have the potential to significantly strengthen the security of wireless networks.We propose a practical security scheme by which two terminals (say Alice and Bob) are able to exploit the randomness of wireless fading channels to exchange data in an informationtheoretically secure way.To ensure that a potential eavesdropper (say Eve) is unable to decode any useful information, Alice sends useful symbols to Bob only when the instantaneous secrecy capacity is strictly positive.In the remaining time, a specially designed class of LDPC codes is used for reconciliation, thus allowing the extraction of a secret key, which can be distilled using privacy amplification.We believe this opportunistic approach can be used effectively as a physical layer complement to existing cryptographic 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.
Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. Our main interest is in the disadvantaged wireless environment, where the channel from the transmitter Alice to the eavesdropper Eve is (possibly much) better than that from Alice to Bob, hence making information-theoretic secrecy challenging. We present a method to exploit inherent vulnerabilities of the eavesdropper's receiver through the use of “cheap” cryptographically-secure key-bits, which only need be kept secret from Eve for the (short) transmission period of the message, to obtain information-theoretic (i.e. everlasting) secret bits at Bob. In particular, based on an ephemeral cryptographic key pre-shared between Alice and Bob, a random jamming signal with large variations is added to each symbol. The legitimate receiver Bob uses the key to subtract the jamming signal immediately, while Eve is forced to perform the inherently nonlinear operation of recording the signal; when Eve then obtains the key, which we assume pessimistically (for Alice) happens right after message transmission, Eve can then immediately subtract the jamming signal from the recorded signal. But, because of the intervening non-linear operation in Eve's receiver and the non-commutativity of nonlinear operations, Bob's channel and Eve's channel have different achievable rates and information-theoretic secrecy can be obtained, hence achieving the goal of converting the vulnerable cryptographic secret key into information-theoretic secure bits. The achievable secrecy rates for different settings are evaluated. Among other results, it is shown that, even when the eavesdropper has perfect access to the output of the transmitter (albeit through an imperfect analog-to-digital converter), the method can still achieve a positive secrecy rate.
The broadcast nature of the wireless medium makes the communication over this medium vulnerable to eavesdropping. This report considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper. The assumption used is that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdropper. The transmitter ensures secrecy of communication by utilizing some of the available power to produce ‘artificial noise’, such that only the eavesdropper’s channel is degraded. Two scenarios are considered, one where the transmitter has multiple transmit antennas, and the other where amplifying relays simulate the effect of multiple antennas. The channel state information (CSI) is assumed to be publicly known, and hence, the secrecy of communication is independent of the secrecy of CSI.
A secret-key sharing strategy based on layered broadcast coding is introduced for slow fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from a passive eavesdropper, Eve. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow fading, and perfect channel state information (CSI) is assumed to be known only at the receivers during the transmission. Layered coding facilitates adapting the reliably decoded rate at Bob to the actual channel state without CSI available at Alice. The index of a reliably decoded layer is sent back to Alice via a public and error-free channel, which is exploited by Alice and Bob to generate the secret key. In this paper, the secrecy key rate is derived. In addition, the optimal power distribution over coded layers is characterized. It is shown that layered coding can increase the secrecy key rate significantly compared with single-level coding.
The broadcast nature of the wireless medium makes the communication over this medium vulnerable to eavesdropping. This paper considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper. The assumption used is that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdropper. The transmitter ensures secrecy of communication by utilizing some of the available power to produce 'artificial noise', such that only the eavesdropper's channel is degraded. Two scenarios are considered, one where the transmitter has multiple transmit antennas, and the other where amplifying relays simulate the effect of multiple antennas. The channel state information (CSI) is assumed to be publicly known, and hence, the secrecy of communication is independent of the secrecy of CSI.