Securing Multi-User Broadcast Wiretap Channels with Finite CSI Feedback

by   Amal Hyadi, et al.

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 multi-user 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.



There are no comments yet.


page 1

page 2

page 3

page 4


Erasure Broadcast Channels with Intermittent Feedback

Achievable data rates in wireless systems rely heavily on the available ...

Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints

In many wireless systems, the signal-to-interference-and-noise ratio tha...

On Sum Secure Degrees of Freedom for K-User MISO Broadcast Channel With Alternating CSIT

In this paper, the sum secure degrees of freedom (SDoF) of the K-user Mu...

Analysis of Communication Channels Related to Physical Unclonable Functions

Cryptographic algorithms rely on the secrecy of their corresponding keys...

Wiretap and Gelfand-Pinsker Channels Analogy and its Applications

A framework of analogy between wiretap channels (WTCs) and state-depende...

Undoing Causal Effects of a Causal Broadcast Channel with Cooperating Receivers using Entanglement Resources

We analyse a communication scenario over a particular causal broadcast c...

Secrecy Analyses of a Full-Duplex MIMOME Network

This paper presents secrecy analyses of a full-duplex MIMOME network whi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.