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

Conference on Information Sciences and Systems

Secrecy capacity of the ergodic layered erasure wiretap channel

Mohammad K. Hossan, Sanjay Karmakar

Published Mar 1, 2015• 4 citations
Publisher

Abstract

We consider the layered erasure wiretap channel which can also be viewed as the time varying version of the deterministic model of the wiretap channel and characterize its secrecy capacity. We assume an arbitrary fading statistics for the erasure probabilities of the layers and assume that only the fading statistics is known at the transmitter while the instantaneous erasure information, i.e., which layers are erased in a particular channel use, is known at both the receivers. The converse is based on an enhancement technique where we first construct an enhanced wiretap channel and then derive upper bound to the secrecy capacity of the enhanced channel. On the achievability side we show that a coding scheme, in which information is transmitted only via a subset of the layers chosen carefully depending on the channel statistics and independent coding is done across different layers in this subset, can achieve the upper bound.

DOI
10.1109/ciss.2015.7086891

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 ergodic secrecy capacity of the wiretap channel under imperfect main channel estimation

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

The ergodic secrecy capacity of the wiretap channel is known when the main channel (between the transmitter and the legitimate receiver) state information (CSI) is perfect at the transmitter and the coherence period is sufficiently large to enable random coding arguments in each block. In a fast fading scenario, when the codeword length spans many coherence periods, the secrecy capacity is still not known. In this paper, we present a framework that characterizes this secrecy capacity under imperfect main channel estimation at the transmitter. Inner and outer bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate is a simple on-off scheme using a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and the eavesdropper channels. The upper and the lower bounds coincide with recently derived ones in the perfect main CSI extreme. Furthermore, the lower bound matches the upper bound in no main CSI extreme, where the secrecy capacity is equal to zero. Numerical results are provided for independent identically distributed (i.i.d.) Rayleigh fading channels.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•20 citations

On the Fast Fading Gaussian Wiretap Channel With Statistical Channel State Information at the Transmitter

Pin-Hsun Lin, Eduard Axel Jorswieck

In this paper, we investigate the ergodic secrecy capacity of the fast fading Gaussian wiretap channel when only the statistics of the channel state information are known at the transmitter. We derive conditions for the existence of degradedness and a positive ergodic secrecy capacity under the usual stochastic order, the convex order, and the increasing convex order between the legitimate and eavesdropper channels. For more general orders, we prove the secrecy capacity of layered erasure wiretap channels and propose a layered signaling for the achievable scheme, and we derive an upper bound on the capacity for fast fading Gaussian wiretap channels. Finally, the numerical results show that under Nakagami-m fast fading channels, the proposed layered signaling outperforms the Gaussian codebook in several cases. In particular, in certain cases, the Gaussian codebook can achieve only a zero secrecy rate, whereas the proposed scheme achieves positive secrecy rates. Therefore, the connectivity of wireless networks can be significantly improved by the proposed scheme.

IEEE Transactions on Information Forensics and Security•Sep 3, 2015•25 citations

On the fading Gaussian wiretap channel with statistical channel state information at transmitter

Pin-Hsun Lin, Eduard Axel Jorswieck

In this paper we partially characterize the relation between the ergodic secrecy capacity of fast fading wiretap channels and the stochastic orders including the usual stochastic orders, the convex orders, and the increasing convex orders, of the main and eavesdropper's channels. We assume that there is only statistical channel state information of both channels at transmitter and both fading channels can be with arbitrary distributions. We derive the sufficient conditions for the existence of the positive ergodic secrecy capacity under these three orders. For more general orders we also derive capacity lower and upper bounds. To achieve it, we apply the concept of channel enhancement to the continuous fading wiretap channel and derive an upper bound. Motivated by the upper bound, we also derive the lower bound of the ergodic secrecy capacity by the layered signaling. Finally numerical results show that under Nakagami-m channels, the proposed achievable scheme outperforms Gaussian signaling in several cases. More specifically, the proposed scheme may result in positive secrecy rate while Gaussian signaling only lead to zero. Thus when we apply the proposed scheme to the wireless network, the connectivity can be significantly improved.

IEEE Conference on Communications and Network Security•Oct 1, 2014•5 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

Comparison of coding strategies for the block fading erasure wiretap channel

Anuradha Wickramasooriya, Ingmar Land, R. Subramanian

In this paper we study the block fading binary erasure wiretap channel, where the transmitter sends secret messages to a legitimate receiver over a block fading erasure channel in the presence of an eavesdropper. The eavesdropper receives the transmitted secret message over a separate block fading binary erasure channel. It is assumed that the transmitter knows the instantaneous channel state information (CSI) of the main channel and knows only the probability distribution of the capacity of the wiretap channel. We mainly consider the case where the transmitter adapts the code based on the CSI of the main channel in order to achieve either a certain secrecy rate or a certain level of secrecy. We compare the two proposed scenarios for the adaptive coding method based on the probability of secrecy outage and the average throughput.

Australian Communications Theory Workshop•Jan 1, 2013•1 citation
We consider the layered erasure wiretap channel which can also be viewed as the time varying version of the deterministic model of the wiretap channel and characterize its secrecy capacity. We assume an arbitrary fading statistics for the erasure probabilities of the layers and assume that only the fading statistics is known at the transmitter while the instantaneous erasure information, i.e., which layers are erased in a particular channel use, is known at both the receivers. The converse is based on an enhancement technique where we first construct an enhanced wiretap channel and then derive upper bound to the secrecy capacity of the enhanced channel. On the achievability side we show that a coding scheme, in which information is transmitted only via a subset of the layers chosen carefully depending on the channel statistics and independent coding is done across different layers in this subset, can achieve the upper bound.
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.
The ergodic secrecy capacity of the wiretap channel is known when the main channel (between the transmitter and the legitimate receiver) state information (CSI) is perfect at the transmitter and the coherence period is sufficiently large to enable random coding arguments in each block. In a fast fading scenario, when the codeword length spans many coherence periods, the secrecy capacity is still not known. In this paper, we present a framework that characterizes this secrecy capacity under imperfect main channel estimation at the transmitter. Inner and outer bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate is a simple on-off scheme using a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and the eavesdropper channels. The upper and the lower bounds coincide with recently derived ones in the perfect main CSI extreme. Furthermore, the lower bound matches the upper bound in no main CSI extreme, where the secrecy capacity is equal to zero. Numerical results are provided for independent identically distributed (i.i.d.) Rayleigh fading channels.
In this paper, we investigate the ergodic secrecy capacity of the fast fading Gaussian wiretap channel when only the statistics of the channel state information are known at the transmitter. We derive conditions for the existence of degradedness and a positive ergodic secrecy capacity under the usual stochastic order, the convex order, and the increasing convex order between the legitimate and eavesdropper channels. For more general orders, we prove the secrecy capacity of layered erasure wiretap channels and propose a layered signaling for the achievable scheme, and we derive an upper bound on the capacity for fast fading Gaussian wiretap channels. Finally, the numerical results show that under Nakagami-m fast fading channels, the proposed layered signaling outperforms the Gaussian codebook in several cases. In particular, in certain cases, the Gaussian codebook can achieve only a zero secrecy rate, whereas the proposed scheme achieves positive secrecy rates. Therefore, the connectivity of wireless networks can be significantly improved by the proposed scheme.
In this paper we partially characterize the relation between the ergodic secrecy capacity of fast fading wiretap channels and the stochastic orders including the usual stochastic orders, the convex orders, and the increasing convex orders, of the main and eavesdropper's channels. We assume that there is only statistical channel state information of both channels at transmitter and both fading channels can be with arbitrary distributions. We derive the sufficient conditions for the existence of the positive ergodic secrecy capacity under these three orders. For more general orders we also derive capacity lower and upper bounds. To achieve it, we apply the concept of channel enhancement to the continuous fading wiretap channel and derive an upper bound. Motivated by the upper bound, we also derive the lower bound of the ergodic secrecy capacity by the layered signaling. Finally numerical results show that under Nakagami-m channels, the proposed achievable scheme outperforms Gaussian signaling in several cases. More specifically, the proposed scheme may result in positive secrecy rate while Gaussian signaling only lead to zero. Thus when we apply the proposed scheme to the wireless network, the connectivity can be significantly improved.
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.
In this paper we study the block fading binary erasure wiretap channel, where the transmitter sends secret messages to a legitimate receiver over a block fading erasure channel in the presence of an eavesdropper. The eavesdropper receives the transmitted secret message over a separate block fading binary erasure channel. It is assumed that the transmitter knows the instantaneous channel state information (CSI) of the main channel and knows only the probability distribution of the capacity of the wiretap channel. We mainly consider the case where the transmitter adapts the code based on the CSI of the main channel in order to achieve either a certain secrecy rate or a certain level of secrecy. We compare the two proposed scenarios for the adaptive coding method based on the probability of secrecy outage and the average throughput.