Secure Broadcasting With Imperfect Channel State Information at the Transmitter

Hyadi, Amal; Rezki, Zouheir; Khisti, Ashish; Alouini, Mohamed‐Slim

doi:10.1109/twc.2015.2500563

Cited by 17 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The secrecy performance of multi-user systems has been of interest in a number of recent research works. For the broadcast multi-user scenario, the secrecy capacity of parallel and fading channels, assuming perfect main channel state information (CSI) at the transmitter (CSIT), was considered in [7] and [8] while the case of imperfect main channel estimation was elaborated in [9]. For the multiple access scenario, the authors in [10] and [11] investigated the secrecy capacity of degraded wiretap channels.…”

Section: A Literature Reviewmentioning

confidence: 99%

“…The uncertainty of the CSIT can also be the result of an error of estimation at the transmitter or of a delayed feedback information. The authors in the following works, [9], [36]- [39], examined the case when the uncertainty is the result of an error of estimation, and [40]- [42] considered the wiretap channel with outdated CSI. A synopsis of how different levels of CSIT impact the system's security is provided in [43] and a detailed state-of-the-art review of physical layer security with CSIT uncertainty is presented in [44].…”

Section: A Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Securing Multi-User Broadcast Wiretap Channels With Finite CSI Feedback

Hyadi

Rezki

Alouini

2020

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the throughput of multiuser broadcast wiretap channels. We consider that the transmitter is only provided by a b-bits feedback of the main channel state information (CSI) sent by each legitimate receiver, at the beginning of each fading block, over error-free public links with limited capacity. Also, we assume that the transmitter is aware of the statistics of the eavesdropper's CSI but not of its channel's realizations. Under these assumptions of CSI uncertainty, we characterize the ergodic secrecy capacity of the system when a common message is broadcasted to all legitimate receivers, the ergodic secrecy sum-capacity when multiple independent messages are transmitted, and the ergodic secrecy capacity region for the broadcast channel with confidential messages (BCCM). In all three scenarios, we show that as long as the transmitter has some knowledge of the main CSI, obtained even through a 1-bit CSI feedback, a non-zero secrecy rate can still be achieved. The impact of having the feedback sent over a binary erasure channel (BEC) is also investigated for the BCCM case. Here again, and even with the possibility of having the feedback bits erased, a positive secrecy rate can still be achieved as long as the erasure event is not a probability-one event. An asymptotic analysis of the obtained results is provided for the high SNR regime, and the scaling law of the system, when the number of legitimate receivers is large, is also presented. Index Terms Ergodic secrecy capacity, channel state information, broadcast channel, block-fading channel, binary erasure channel, limited feedback.

show abstract

Section: A Literature Reviewmentioning

confidence: 99%

Section: A Literature Reviewmentioning

confidence: 99%

Securing Multi-User Broadcast Wiretap Channels With Finite CSI Feedback

Hyadi

Rezki

Alouini

2020

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…which is the Shannon transform of the eigenvalue distribution of the matrix A when n is large. The Shannon transform of the eigenvalue distribution of Θ with parameter η is obviously given by (19). And the ηtransform of the eigenvalue distribution of Θ with parameter x is obviously given by…”

Section: Appendix a Proof Of Lemmamentioning

confidence: 99%

“…The MIMOME related works in the literature include: [4]- [15] where the channel state information (CSI) at Eve is assumed to be known not only to Eve itself 1 but also to Alice and Bob; [16]- [19] where a partial knowledge of Eve's CSI is assumed to be available to Alice and Bob and an averaged secrecy or secrecy outage was considered; [13], [20]- [25] where artificial noise is embedded in the signal from Alice; and [26]- [31] where Bob is treated as a full-duplex node capable to receive the signal from Alice while transmitting jamming noise.…”

Section: Introductionmentioning

confidence: 99%

Secrecy Analyses of a Full-Duplex MIMOME Network

Sohrabi¹,

Zhu²,

Hua³

2019

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

This paper presents secrecy analyses of a full-duplex MIMOME network which consists of two full-duplex multiantenna users (Alice and Bob) and an arbitrarily located multiantenna eavesdropper (Eve). The paper assumes that Eve's channel state information (CSI) is completely unknown to Alice and Bob except for a small radius of secured zone. The first part of this paper aims to optimize the powers of jamming noises from both users. To handle Eve's CSI being unknown to users, the focus is placed on Eve at the most harmful location, and the large matrix theory is applied to yield a hardened secrecy rate to work on. The performance gain of the power optimization in terms of maximum tolerable number of antennas on Eve is shown to be significant. The second part of this paper shows two analyses of anti-eavesdropping channel estimation (ANECE) that can better handle Eve with any number of antennas. One analysis assumes that Eve has a prior statistical knowledge of its CSI, which yields lower and upper bounds on secure degrees of freedom of the system as functions of the number (N) of antennas on Eve and the size (K) of information packet. The second analysis assumes that Eve does not have any prior knowledge of its CSI but performs blind detection of information, which yields an approximate secrecy rate for the case of K being larger than N.Index Terms-Physical layer security, secrecy rate, full-duplex radio, MIMOME, jamming, artificial noise, anti-eavesdropping channel estimation (ANECE).

show abstract

“…For the broadcast multi-users scenario, the secrecy capacity of parallel and fading channels, assuming perfect main CSI at the transmitter, was considered in [7] and [8]. The case of imperfect main channel estimation was elaborated in [9]. For the multiple access scenario, the authors in [10] and [11] investigated the secrecy capacity of degraded wiretap channels.…”

Section: Introductionmentioning

confidence: 99%

On the secrecy capacity of the broadcast wiretap channel with limited CSI feedback

Hyadi

Rezki

Alouini

2016

2016 IEEE Information Theory Workshop (ITW)

Self Cite

View full text Add to dashboard Cite

In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via a finite rate feedback on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper. Indeed, we consider that the transmitter is only provided by a b-bits feedback of the main channel state information (CSI). The feedback bits are sent by each legitimate receiver, at the beginning of each fading block, over error-free public links with limited capacity. Also, we assume that the transmitter is aware of the statistics of the eavesdropper's CSI but not of its channel's realizations. Assuming an average transmit power constraint, we establish upper and lower bounds on the ergodic secrecy capacity. We consider both the common message transmission case, where the source broadcasts the same information to all the receivers, and the independent messages case, where the transmitter broadcasts multiple independent messages to the legitimate receivers. In both scenarios, we show that the proposed lower and upper bounds coincide asymptotically as the capacity of the feedback links become large, i.e. b → ∞; hence, fully characterizing the secrecy capacity in this case.

show abstract

Secure Broadcasting With Imperfect Channel State Information at the Transmitter

Cited by 17 publications

References 24 publications

Securing Multi-User Broadcast Wiretap Channels With Finite CSI Feedback

Securing Multi-User Broadcast Wiretap Channels With Finite CSI Feedback

Secrecy Analyses of a Full-Duplex MIMOME Network

On the secrecy capacity of the broadcast wiretap channel with limited CSI feedback

Contact Info

Product

Resources

About