Securing Multi-User Broadcast Wiretap Channels with Finite CSI Feedback
Type
Preprint
KAUST Department
Communication Theory LabComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Date
2020-04-21Preprint Posting Date
2020-04-18Online Publication Date
2020-04-21Print Publication Date
2020-07Permanent link to this record
http://hdl.handle.net/10754/662601Metadata
Show full item recordAbstract
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.Citation
Hyadi, A., Rezki, Z., & Alouini, M.-S. (2020). Securing Multi-User Broadcast Wiretap Channels with Finite CSI Feedback. IEEE Transactions on Information Theory, 1–1. doi:10.1109/tit.2020.2988862arXiv
2004.10023Additional Links
https://arxiv.org/pdf/2004.10023http://arxiv.org/pdf/2004.10023
Scopus Count
Related items
Showing items related by title, author, creator and subject.
-
Multi-rate control over AWGN channels via analog joint source-channel coding(2016 IEEE 55th Conference on Decision and Control (CDC), Institute of Electrical and Electronics Engineers (IEEE), 2017-01-05) [Conference Paper]We consider the problem of controlling an unstable plant over an additive white Gaussian noise (AWGN) channel with a transmit power constraint, where the signaling rate of communication is larger than the sampling rate (for generating observations and applying control inputs) of the underlying plant. Such a situation is quite common since sampling is done at a rate that captures the dynamics of the plant and which is often much lower than the rate that can be communicated. This setting offers the opportunity of improving the system performance by employing multiple channel uses to convey a single message (output plant observation or control input). Common ways of doing so are through either repeating the message, or by quantizing it to a number of bits and then transmitting a channel coded version of the bits whose length is commensurate with the number of channel uses per sampled message. We argue that such “separated source and channel coding” can be suboptimal and propose to perform joint source-channel coding. Since the block length is short we obviate the need to go to the digital domain altogether and instead consider analog joint source-channel coding. For the case where the communication signaling rate is twice the sampling rate, we employ the Archimedean bi-spiral-based Shannon-Kotel'nikov analog maps to show significant improvement in stability margins and linear-quadratic Gaussian (LQG) costs over simple schemes that employ repetition.
-
Achievable Rates of Secure Transmission in Gaussian MISO Channel with Imperfect Main Channel Estimation(2015 IEEE Globecom Workshops (GC Wkshps), Institute of Electrical and Electronics Engineers (IEEE), 2016-02-26) [Conference Paper]A Gaussian multiple-input single-output (MISO) fading channel is considered. We assume that the transmitter, in addition to the statistics of all channel gains, is aware instantaneously of a noisy version of the channel to the legitimate receiver. On the other hand, the legitimate receiver is aware instantaneously of its channel to the transmitter, whereas the eavesdropper instantaneously knows all channel gains. We evaluate an achievable rate using a Gaussian input without indexing an auxiliary random variable. A sufficient condition for beamforming to be optimal is provided. When the number of transmit antennas is large, beamforming also turns out to be optimal. In this case, the maximum achievable rate can be expressed in a simple closed form and scales with the logarithm of the number of transmit antennas. Furthermore, in the case when a noisy estimate of the eavesdropper's channel is also available at the transmitter, we introduce the SNR difference and the SNR ratio criterions and derive the related optimal transmission strategies and the corresponding achievable rates.
-
The MISO Wiretap Channel with Noisy Main Channel Estimation in the High Power Regime(2016 IEEE Global Communications Conference (GLOBECOM), Institute of Electrical and Electronics Engineers (IEEE), 2017-02-07) [Conference Paper]We improve upon our previous upper bound on the secrecy capacity of the wiretap channel with multiple transmit antennas and single-antenna receivers, with noisy main channel state information (CSI) at the transmitter (CSI-T). Specifically, we show that if the main CSI error does not scale with the power budget at the transmitter P̅, then the secrecy capacity is )bounded above essentially by log log (P̅ yielding a secure degree of freedom (sdof) equal to zero. However, if the main CSI error scales as O(P̅-β), for β ∈ [0,1], then the sdof is equal to β.