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

Unconditionally secure communications over fading channels

Michael A. Tope, J.C. McEachen

Published Nov 13, 2002• 79 citations
Publisher

Abstract

In this paper, we propose a novel method for two communicates to exchange a secret over a public wireless fading channel. Unlike conventional computationally secure public key methods, this technique is information theoretic and unconditionally secure provided that a component of the reciprocal channel fading over time between the two communicates is statistically independent with the channel fading from either communicate to the eavesdropper. This technique may be particularly well suited to secure tactical mobile communications. A simple protocol suitable for a lognormal shadowed fading channel is described and its key exchange rate is derived.

DOI
10.1109/milcom.2001.985763

Related papers

Wireless Information-Theoretic Security

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

This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal—even in the presence of imperfect channel state information.

IEEE Transactions on Information Theory•May 29, 2008•1,838 citations

A secret key negotiation scheme for wireless communications over fading channels

Nana Zhang, Hongwen Yang

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.

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)•Aug 1, 2015•1 citation

Hybrid Approach in Information-Hypothetically Furtive Solution Generation for Vanishing Wireless Channels

J. Nagaraj, G. M. Kadhar Nawaz

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 shortterm 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 the “Reciprocity based key exchange model” allows two parties jointly establish  physically secure key combined with a (standard) computationally secure key, over an insecure communication channel. This key can then be used to encrypt subsequent communications. 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 validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical Wi-Fi channel that reliable secret key establishment can be accomplished at rates on the order of 11 b/s.

CiiT international journal of networking and communication engineering•Jan 1, 2012•0 citations

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

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

Empirical Bounds on the Rate of Secret Bits Extracted from Received Signal Strength

Sima Azizi, Arash Komaee

Symmetric cryptography relies on pairs of identical secret keys shared by the legitimate communicating parties. To implement a symmetric-key algorithm for cryptography, a major concern is to develop secure methods for distribution of the secret key. In securing the wireless fading channels by symmetric-key algorithms, the physical layer properties of the channel can be exploited for distribution of the secret keys. In this approach, the channel state provides a common randomness which is shared by the legitimate users but is mostly unknown to an eavesdropper. by means of signal processing techniques, this common randomness is extracted into random secret keys. This paper establishes an information theoretic upper bound on the rate at which the secret keys can be extracted. Instead of the conventional approach that relies on mathematical models for the wireless channel, this paper adopts an experimental approach to estimate this bound from empirical data. A set of signal processing techniques is developed here to numerically estimate this bound for a pair of received signal strength (RSS) recorded by indoor commercial radios.

Conference on Information Sciences and Systems•Mar 1, 2019•0 citations
In this paper, we propose a novel method for two communicates to exchange a secret over a public wireless fading channel. Unlike conventional computationally secure public key methods, this technique is information theoretic and unconditionally secure provided that a component of the reciprocal channel fading over time between the two communicates is statistically independent with the channel fading from either communicate to the eavesdropper. This technique may be particularly well suited to secure tactical mobile communications. A simple protocol suitable for a lognormal shadowed fading channel is described and its key exchange rate is derived.
This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal—even in the presence of imperfect channel state information.
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.
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 shortterm 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 the “Reciprocity based key exchange model” allows two parties jointly establish  physically secure key combined with a (standard) computationally secure key, over an insecure communication channel. This key can then be used to encrypt subsequent communications. 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 validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical Wi-Fi channel that reliable secret key establishment can be accomplished at rates on the order of 11 b/s.
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.
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.
Symmetric cryptography relies on pairs of identical secret keys shared by the legitimate communicating parties. To implement a symmetric-key algorithm for cryptography, a major concern is to develop secure methods for distribution of the secret key. In securing the wireless fading channels by symmetric-key algorithms, the physical layer properties of the channel can be exploited for distribution of the secret keys. In this approach, the channel state provides a common randomness which is shared by the legitimate users but is mostly unknown to an eavesdropper. by means of signal processing techniques, this common randomness is extracted into random secret keys. This paper establishes an information theoretic upper bound on the rate at which the secret keys can be extracted. Instead of the conventional approach that relies on mathematical models for the wireless channel, this paper adopts an experimental approach to estimate this bound from empirical data. A set of signal processing techniques is developed here to numerically estimate this bound for a pair of received signal strength (RSS) recorded by indoor commercial radios.