TY - GEN
T1 - On the secrecy capacity of the broadcast wiretap channel with limited CSI feedback
AU - Hyadi, Amal
AU - Rezki, Zouheir
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2016/10/27
Y1 - 2016/10/27
N2 - 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. First, we partially characterize the ergodic secrecy capacity of the system when the source broadcasts the same information to all the receivers, i.e., common message transmission. Then, we look at the independent messages case, where the transmitter broadcasts multiple independent messages to the legitimate receivers. For this case, we present lower and upper bounds on the ergodic secrecy sum-capacity. In both scenarios, we show that the proposed lower and upper bounds coincide asymptotically as the capacity of the feedback links becomes large, hence, fully characterizing the secrecy capacity in this case.
AB - 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. First, we partially characterize the ergodic secrecy capacity of the system when the source broadcasts the same information to all the receivers, i.e., common message transmission. Then, we look at the independent messages case, where the transmitter broadcasts multiple independent messages to the legitimate receivers. For this case, we present lower and upper bounds on the ergodic secrecy sum-capacity. In both scenarios, we show that the proposed lower and upper bounds coincide asymptotically as the capacity of the feedback links becomes large, hence, fully characterizing the secrecy capacity in this case.
UR - http://hdl.handle.net/10754/622576
UR - http://ieeexplore.ieee.org/document/7606791/
UR - http://www.scopus.com/inward/record.url?scp=84998678118&partnerID=8YFLogxK
U2 - 10.1109/ITW.2016.7606791
DO - 10.1109/ITW.2016.7606791
M3 - Conference contribution
SN - 9781509010905
SP - 36
EP - 40
BT - 2016 IEEE Information Theory Workshop (ITW)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -