Research on an Outer Bound of Achievable Secrecy Rate Region for BCE

The security performance problems of broadcast channel with an eavesdropper (BCE) have been studied for many years in the field of communication. Many articles have given the meaningful results. However, almost no consequent of an outer bound on BCE has been given by previous work, especially, no significant results has been given. So this paper proposes and proves an outer bound of BCE by using information entropy, and further proves this outer bound is tight in the cut-set bound by max-flow min-cut theorem. It illustrates the outer bound is meaningful. Finally, by contrasting a variety of existing results, we can get that the outer bound in this paper include (tight) in the existing outer bound of BCE in the case of not considering the eavesdropper.

[1]  Zhi Xue,et al.  Research on the Security of MISO Wireless Channel with Artificial Noise , 2013, 2013 International Conference on Computational and Information Sciences.

[2]  Jie Gu,et al.  Research on the Multiple-Input Single-Output Channel under Attack , 2012, 2012 Fourth International Conference on Computational and Information Sciences.

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

[4]  G. Kramer,et al.  Capacity Theorems for Cooperative Relay Broadcast Channels , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[5]  Jie Gu,et al.  Security in Single-Input Single-Output Multiple-helpers Wireless Channel , 2012, 2012 Fourth International Conference on Computational and Information Sciences.

[6]  Jin Xu,et al.  Capacity Bounds for Broadcast Channels With Confidential Messages , 2009, IEEE Transactions on Information Theory.

[7]  Zhi Xue,et al.  Artificial Noise Generated in MIMO Scenario: Optimal Power Design , 2013, IEEE Signal Processing Letters.

[8]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[9]  Alfred O. Hero,et al.  Secure space-time communication , 2003, IEEE Trans. Inf. Theory.

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

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

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

[13]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[14]  Abbas El Gamal,et al.  An Outer Bound to the Capacity Region of the Broadcast Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[16]  Foreword and Editorial International Journal of Hybrid Information Technology , 2022 .

[17]  Abbas El Gamal,et al.  An outer bound to the capacity region of the broadcast channel , 2006, ISIT.

[18]  Zhi Xue,et al.  Research on Secrecy Communication via Bilateral Artificial Noise Transmitting , 2013, 2013 International Conference on Computational and Information Sciences.