Layered decoding and secrecy over degraded broadcast channels

A K-receiver degraded broadcast channel with layered decoding and secrecy constraints is investigated, in which receivers are ordered by their channel quality. Each receiver is required to decode one more message compared to the receiver with one level worse channel quality, and this message should be kept secure from all receivers with worse channel quality. For both the discrete memoryless channel and the Gaussian channel, the secrecy capacity region is characterized. The achievability scheme is based on stochastic encoding and superposition coding schemes. Novel generalization of the analysis of leakage rates and of the proof of the converse is developed for the K-receiver scenario.

[1]  Carles Padró,et al.  Information Theoretic Security , 2013, Lecture Notes in Computer Science.

[2]  Lele Wang,et al.  A comparison of superposition coding schemes , 2013, 2013 IEEE International Symposium on Information Theory.

[3]  Sennur Ulukus,et al.  Degraded Compound Multi-Receiver Wiretap Channels , 2009, IEEE Transactions on Information Theory.

[4]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[5]  Shlomo Shamai,et al.  Secret sharing via noisy broadcast channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[6]  Roy D. Yates,et al.  Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions , 2007, IEEE Transactions on Information Theory.

[7]  Amir K. Khandani,et al.  The Secrecy Rate Region of the Broadcast Channel , 2008, ArXiv.

[8]  Gregory W. Wornell,et al.  Secure Broadcasting Over Fading Channels , 2008, IEEE Transactions on Information Theory.

[9]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[10]  Shlomo Shamai,et al.  Secure Communication Over Fading Channels , 2007, IEEE Transactions on Information Theory.

[11]  Shlomo Shamai,et al.  A Vector Generalization of Costa's Entropy-Power Inequality With Applications , 2009, IEEE Transactions on Information Theory.

[12]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[13]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[14]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[15]  A. Sridharan.  Broadcast Channels , 2022 .

[16]  Shlomo Shamai,et al.  Broadcasting over fading wiretap channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.