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 International Symposium on Information Theory (ISIT)

Secrecy Capacity of Wireless Channels

João Barros, Miguel R. D. Rodrigues

Published Jul 1, 2006• 828 citations
Publisher

Abstract

We consider the transmission of confidential data over wireless channels with multiple communicating parties. Based on an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel, we define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe.

DOI
10.1109/isit.2006.261613

Related papers

Wireless Information-Theoretic Security - Part I: Theoretical Aspects

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

In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless information-theoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper.

arXiv:cs/0611120•Nov 22, 2006•21 citations

Secure wireless multicasting through Rayleigh fading channels — A secrecy tradeoff

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah, Mathini Sellathurai

In this paper, a wireless multicast scenario is considered in which the transmitter sends a common message to multiple client receivers in the presence of an eavesdropper. We are interested in protecting this common message against eavesdropping. Based on an information-theoretic formulation of the problem, in which the transmitter and the mutually independent multiple client receivers communicate over quasi-static Rayleigh fading channels and an eavesdropper observes their transmissions through another quasi-static Rayleigh fading channel, we define the secrecy-sum capacity in terms of secure outage probability. Moreover, we also present a formulation of ergodic perfect secrecy multicast capacity at which the eavesdropper is unable to decode any information.

UK-India International Workshop on Cognitive Wireless Systems (UKIWCWS)•Dec 1, 2009•14 citations

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,853 citations

Secrecy capacity of Nakagami-m fading wireless channels in the presence of multiple eavesdroppers

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah, Mathini Sellathurai

This paper is concerned with the transmission of confidential message through Nakagami-m fading wireless channel in the presence of multiple eavesdroppers. The eavesdroppers are mutually independent and the information is secure if it cannot be eavesdropped by any eavesdropper. Considering the problem of secret communications between two nodes over Nakagami-m fading channel where a number of eavesdroppers observes their transmissions through other Nakagami-m fading channels, we characterize the probability of non-zero secrecy capacity and secure outage probability to investigate the secrecy capacity in terms of secure outage probability. We also present a formulation of the ergodic secrecy capacity in the presence of multiple eavesdroppers.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Jan 1, 2009•68 citations

Backing off from rayleigh and rice: Achieving perfect secrecy in wireless fading channels

Pablo Ramirez‐Espinosa, F. Javier López‐Martínez

We show that for a legitimate communication under multipath quasi-static fading with a reduced number of scatter- ers, it is possible to achieve perfect secrecy even in the presence of a passive eavesdropper for which no channel state information is available. Specifically, we show that the outage probability of secrecy capacity (OPSC) is zero for a given range of average signal-to-noise ratios (SNRs) at the legitimate and eavesdropper’s receivers. As an application example, we analyze the OPSC for the case of two scatterers, explicitly deriving the relationship between the average SNRs, the secrecy rate RS and the fading model parameters required for achieving perfect secrecy.

•Sep 1, 2020•0 citations

Information-theoretic security in wireless multicasting

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah

In this paper, a wireless multicast scenario is considered in which the transmitter sends a common message to a group of client receivers through quasi-static Rayleigh fading channel in the presence of an eavesdropper. The communication between transmitter and each client receiver is said to be secured if the eavesdropper is unable to decode any information. On the basis of an information-theoretic formulation of the confidential communications between transmitter and a group of client receivers, we define the expected secrecy sum-mutual information in terms of secure outage probability and provide a complete characterization of maximum transmission rate at which the eavesdropper is unable to decode any information. Moreover, we find the probability of non-zero secrecy mutual information and present an analytical expression for ergodic secrecy multicast mutual information of the proposed model.

International Conference on Electrical and Computer Engineering (ICECE)•Dec 1, 2010•6 citations
We consider the transmission of confidential data over wireless channels with multiple communicating parties. Based on an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel, we define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe.
In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless information-theoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper.
In this paper, a wireless multicast scenario is considered in which the transmitter sends a common message to multiple client receivers in the presence of an eavesdropper. We are interested in protecting this common message against eavesdropping. Based on an information-theoretic formulation of the problem, in which the transmitter and the mutually independent multiple client receivers communicate over quasi-static Rayleigh fading channels and an eavesdropper observes their transmissions through another quasi-static Rayleigh fading channel, we define the secrecy-sum capacity in terms of secure outage probability. Moreover, we also present a formulation of ergodic perfect secrecy multicast capacity at which the eavesdropper is unable to decode any information.
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.
This paper is concerned with the transmission of confidential message through Nakagami-m fading wireless channel in the presence of multiple eavesdroppers. The eavesdroppers are mutually independent and the information is secure if it cannot be eavesdropped by any eavesdropper. Considering the problem of secret communications between two nodes over Nakagami-m fading channel where a number of eavesdroppers observes their transmissions through other Nakagami-m fading channels, we characterize the probability of non-zero secrecy capacity and secure outage probability to investigate the secrecy capacity in terms of secure outage probability. We also present a formulation of the ergodic secrecy capacity in the presence of multiple eavesdroppers.
We show that for a legitimate communication under multipath quasi-static fading with a reduced number of scatter- ers, it is possible to achieve perfect secrecy even in the presence of a passive eavesdropper for which no channel state information is available. Specifically, we show that the outage probability of secrecy capacity (OPSC) is zero for a given range of average signal-to-noise ratios (SNRs) at the legitimate and eavesdropper’s receivers. As an application example, we analyze the OPSC for the case of two scatterers, explicitly deriving the relationship between the average SNRs, the secrecy rate RS and the fading model parameters required for achieving perfect secrecy.
In this paper, a wireless multicast scenario is considered in which the transmitter sends a common message to a group of client receivers through quasi-static Rayleigh fading channel in the presence of an eavesdropper. The communication between transmitter and each client receiver is said to be secured if the eavesdropper is unable to decode any information. On the basis of an information-theoretic formulation of the confidential communications between transmitter and a group of client receivers, we define the expected secrecy sum-mutual information in terms of secure outage probability and provide a complete characterization of maximum transmission rate at which the eavesdropper is unable to decode any information. Moreover, we find the probability of non-zero secrecy mutual information and present an analytical expression for ergodic secrecy multicast mutual information of the proposed model.