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 Communications

Secrecy Capacity of the Fast Fading SISO Wiretap Channel within 11 Bits with Only CSIR

Sanjay Karmakar, Anirban Ghosh

Published May 1, 2018• 0 citations
Publisher

Abstract

We consider a fast fading 2-receiver Broadcast channel (BC), where one of the receivers is legitimate and the other is malicious/unintended. The instantaneous Channel State Information (CSI) is assumed to be known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to- Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions and has the desirable property of easy computability for arbitrary fading statistics. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds. This result establishes BES-RS scheme as a practically implementable coding scheme that can achieve the secrecy capacity of the FWC within a constant number of bits, where the constant is universal across all fading statistics and SNR. Explicit numerical computation of these bounds shows that the difference between the secrecy rate achievable by the BES-RS scheme and the upper bound is much smaller than the aforementioned universal constant. This in turn suggests that, much of the gap of 11 bits originates from the looseness introduced to bring the two bounds in a compatible form.

DOI
10.1109/icc.2018.8422838

Related papers

Analysis of Secrecy in Multi-User Wireless Network

Anirban Ghosh

We consider an Ergodic Fading Broadcast Channel with one Legitimate receiver and one Eavesdropper (BCoLoE) having arbitrary fading statistics, where the instantaneous Channel State Information (CSI) are known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to-Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds with the help of numerical computation for several BCoLoEs with practical fading statistics. We further characterize the secrecy capacity of a class of 2-user binary fading interference channel (BFIC) and 2-user layered fading interference channel (LFIC), under the same assumptions as for the wiretap channel. The secrecy capacity region for a very weak BFIC turns out to be quadrangular while for LFIC it is polygonal. We explicitly characterize the corner points in both the cases. The converse in either case is proved by dividing the set of upper bounds into two carefully chosen regions depending on the values of ω - the weighting factor of the weighted sum bounds. In case of LFIC each of the regions are also shown to be piece-wise linear. The achievability on the other hand is proved by using capacity optimal code for a layered erasure wiretap channel at both the transmitters and treating interference as erasure while decoding the signals at the receivers. In addition, the achievability of the layered case also involves proper assignment of the layers to the two transmitters based on some constraints. We also prove the secrecy capacity of strong BFIC and LFIC as zero.

•Jan 1, 2018•0 citations

On the secrecy capacity of the broadcast wiretap channel with imperfect channel state information

Amal Hyadi, Zouheir Rezki, Ashish J. Khisti +1 more

In this paper, we consider secure broadcasting over fast fading channels. Assuming imperfect main channel state information (CSI) at the transmitter, we first provide an upper and a lower bounds on the ergodic secrecy capacity when a common message is broadcasted to multiple legitimate receivers in the presence of one eavesdropper. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link. Then, we present an expression for the achievable secrecy sum-rate when each legitimate receiver is interested in an independent message. The special cases of high SNR, perfect and no-main CSI are also analyzed. Numerical results are presented to illustrate the obtained results for the case of independent but not necessarily identically distributed Rayleigh fading channels.

Globecom•Dec 1, 2014•2 citations

On the Secrecy Capacity of the Wiretap Channel With Imperfect Main Channel Estimation

Zouheir Rezki, Ashish J. Khisti, Mohamed‐Slim Alouini

We study the secrecy capacity of fast fading channels under imperfect main channel (between the transmitter and the legitimate receiver) estimation at the transmitter. Lower and upper bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate follows from a standard wiretap code in which a simple on-off power control is employed along with a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and eavesdropper channels and is the best known upper bound so far. The upper and lower bounds coincide with recently derived ones in case of perfect main CSI. Furthermore, the upper bound is tight in case of no main CSI, where the secrecy capacity is equal to zero. Asymptotic analysis at high and low signal-to-noise ratio (SNR) is also given. At high SNR, we show that the capacity is bounded by providing upper and lower bounds that depend on the channel estimation error. At low SNR, however, we prove that the secrecy capacity is asymptotically equal to the capacity of the main channel as if there were no secrecy constraint. Numerical results are provided for i.i.d. Rayleigh fading channels.

IEEE Transactions on Communications•Sep 9, 2014•39 citations

On Secrecy Capacity of Fast Fading Multiple-Input Wiretap Channels With Statistical CSIT

Shih-Chun Lin, Pin-Hsun Lin

We consider the secure transmission in ergodic fast Rayleigh fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels are the only available channel state information at the transmitter (CSIT). By introducing a new secrecy capacity upper bound, we prove that the secrecy capacity is achieved by the Gaussian input without prefixing. To attain this result, we form another MISOSE channel for upper-bounding by relaxing the equivocation constraint, and tighten the bound by carefully selecting correlations between the legitimate and eavesdropper channel gains. The resulting upper bound is tighter than the others in the literature which are based on modifying the correlation between the noises at the legitimate receiver and eavesdropper. Next, we fully characterize the secrecy capacity by showing that the optimal channel input covariance matrix is a scaled identity matrix. The key to solve such a stochastic optimization problem is by exploiting the completely monotone property of the secrecy capacity. Finally, we prove that with only statistical CSIT of both channels, the capacity will neither scale with signal-to-noise ratio (SNR) nor the number of antenna. Our numerical results also match these observations and further confirm that having the legitimate CSIT (realizations) is very beneficial to increase the secrecy capacity.

arXiv:1201.2868•IEEE Transactions on Information Forensics and Security•Dec 12, 2012•44 citations

On the secrecy capacity of fading Gaussian wiretap channel

Md. K. Hossan, Sanjay Karmakar, Anirban Ghosh

We consider the fast-fading Gaussian wiretap channel with single antenna nodes and without channel state information at the transmitter (CSIT), where the fading processes of the two links are arbitrary and independent of each other. We derive an upper bound to the secrecy capacity for this channel and an achievable rate as well. Subsequently, we identify a class of channel statistics for which the outer bound and the achievable rates are identical thereby characterizes the exact secrecy capacity of the channel. The class of channels with such channel statistics are called stochastically degraded in this paper. Many practical wireless settings including the Rayleigh fading environment fall under this stochastically degraded class. We illustrate our results by computing explicit expression for the secrecy capacity for Rayleigh distributed wiretap channels.

Canadian Workshop on Information Theory (CWIT)•Jul 1, 2015•5 citations

On the secrecy capacity of the MISO wiretap channel under imperfect channel estimation

Zouheir Rezki, Basel Alomair, Mohamed‐Slim Alouini

We consider a wiretap channel consisting of a source with multiple antennas, a legitimate receiver and an eavesdropper with a single antenna each. The channels between the source and the receivers undergo fast fading. We assume that the transmitter, in addition to the statistics of both channels, is only aware of a noisy version of the CSI to the legitimate receiver referred to as main channel. The legitimate receiver is aware of both its instantaneous channel gain and the transmitter's estimate of the main channel. On the other hand, the eavesdropper's receiver, in addition to its instantaneous channel realization, is aware of the actual main CSI and the transmitter's estimate as well. While the capacity of this channel is still open even with perfect CSI at the transmitter, we provide in this paper upper and lower bounds on the secrecy capacity. The upper bound is tighter than the one corresponding to perfect main CSI and the gap between the two upper bounds is characterized in function of the channel estimation error variance, at high-SNR. Furthermore, we show that our upper and lower bounds coincide in the case of no main CSI providing a trivial secrecy capacity.

Globecom•Dec 1, 2014•12 citations
We consider a fast fading 2-receiver Broadcast channel (BC), where one of the receivers is legitimate and the other is malicious/unintended. The instantaneous Channel State Information (CSI) is assumed to be known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to- Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions and has the desirable property of easy computability for arbitrary fading statistics. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds. This result establishes BES-RS scheme as a practically implementable coding scheme that can achieve the secrecy capacity of the FWC within a constant number of bits, where the constant is universal across all fading statistics and SNR. Explicit numerical computation of these bounds shows that the difference between the secrecy rate achievable by the BES-RS scheme and the upper bound is much smaller than the aforementioned universal constant. This in turn suggests that, much of the gap of 11 bits originates from the looseness introduced to bring the two bounds in a compatible form.
We consider an Ergodic Fading Broadcast Channel with one Legitimate receiver and one Eavesdropper (BCoLoE) having arbitrary fading statistics, where the instantaneous Channel State Information (CSI) are known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to-Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds with the help of numerical computation for several BCoLoEs with practical fading statistics. We further characterize the secrecy capacity of a class of 2-user binary fading interference channel (BFIC) and 2-user layered fading interference channel (LFIC), under the same assumptions as for the wiretap channel. The secrecy capacity region for a very weak BFIC turns out to be quadrangular while for LFIC it is polygonal. We explicitly characterize the corner points in both the cases. The converse in either case is proved by dividing the set of upper bounds into two carefully chosen regions depending on the values of ω - the weighting factor of the weighted sum bounds. In case of LFIC each of the regions are also shown to be piece-wise linear. The achievability on the other hand is proved by using capacity optimal code for a layered erasure wiretap channel at both the transmitters and treating interference as erasure while decoding the signals at the receivers. In addition, the achievability of the layered case also involves proper assignment of the layers to the two transmitters based on some constraints. We also prove the secrecy capacity of strong BFIC and LFIC as zero.
In this paper, we consider secure broadcasting over fast fading channels. Assuming imperfect main channel state information (CSI) at the transmitter, we first provide an upper and a lower bounds on the ergodic secrecy capacity when a common message is broadcasted to multiple legitimate receivers in the presence of one eavesdropper. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link. Then, we present an expression for the achievable secrecy sum-rate when each legitimate receiver is interested in an independent message. The special cases of high SNR, perfect and no-main CSI are also analyzed. Numerical results are presented to illustrate the obtained results for the case of independent but not necessarily identically distributed Rayleigh fading channels.
We study the secrecy capacity of fast fading channels under imperfect main channel (between the transmitter and the legitimate receiver) estimation at the transmitter. Lower and upper bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate follows from a standard wiretap code in which a simple on-off power control is employed along with a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and eavesdropper channels and is the best known upper bound so far. The upper and lower bounds coincide with recently derived ones in case of perfect main CSI. Furthermore, the upper bound is tight in case of no main CSI, where the secrecy capacity is equal to zero. Asymptotic analysis at high and low signal-to-noise ratio (SNR) is also given. At high SNR, we show that the capacity is bounded by providing upper and lower bounds that depend on the channel estimation error. At low SNR, however, we prove that the secrecy capacity is asymptotically equal to the capacity of the main channel as if there were no secrecy constraint. Numerical results are provided for i.i.d. Rayleigh fading channels.
We consider the secure transmission in ergodic fast Rayleigh fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels are the only available channel state information at the transmitter (CSIT). By introducing a new secrecy capacity upper bound, we prove that the secrecy capacity is achieved by the Gaussian input without prefixing. To attain this result, we form another MISOSE channel for upper-bounding by relaxing the equivocation constraint, and tighten the bound by carefully selecting correlations between the legitimate and eavesdropper channel gains. The resulting upper bound is tighter than the others in the literature which are based on modifying the correlation between the noises at the legitimate receiver and eavesdropper. Next, we fully characterize the secrecy capacity by showing that the optimal channel input covariance matrix is a scaled identity matrix. The key to solve such a stochastic optimization problem is by exploiting the completely monotone property of the secrecy capacity. Finally, we prove that with only statistical CSIT of both channels, the capacity will neither scale with signal-to-noise ratio (SNR) nor the number of antenna. Our numerical results also match these observations and further confirm that having the legitimate CSIT (realizations) is very beneficial to increase the secrecy capacity.
We consider the fast-fading Gaussian wiretap channel with single antenna nodes and without channel state information at the transmitter (CSIT), where the fading processes of the two links are arbitrary and independent of each other. We derive an upper bound to the secrecy capacity for this channel and an achievable rate as well. Subsequently, we identify a class of channel statistics for which the outer bound and the achievable rates are identical thereby characterizes the exact secrecy capacity of the channel. The class of channels with such channel statistics are called stochastically degraded in this paper. Many practical wireless settings including the Rayleigh fading environment fall under this stochastically degraded class. We illustrate our results by computing explicit expression for the secrecy capacity for Rayleigh distributed wiretap channels.
We consider a wiretap channel consisting of a source with multiple antennas, a legitimate receiver and an eavesdropper with a single antenna each. The channels between the source and the receivers undergo fast fading. We assume that the transmitter, in addition to the statistics of both channels, is only aware of a noisy version of the CSI to the legitimate receiver referred to as main channel. The legitimate receiver is aware of both its instantaneous channel gain and the transmitter's estimate of the main channel. On the other hand, the eavesdropper's receiver, in addition to its instantaneous channel realization, is aware of the actual main CSI and the transmitter's estimate as well. While the capacity of this channel is still open even with perfect CSI at the transmitter, we provide in this paper upper and lower bounds on the secrecy capacity. The upper bound is tighter than the one corresponding to perfect main CSI and the gap between the two upper bounds is characterized in function of the channel estimation error variance, at high-SNR. Furthermore, we show that our upper and lower bounds coincide in the case of no main CSI providing a trivial secrecy capacity.