Secrecy over Multiple-Access Channel: A Game of Competition and Cooperation

Communication networks have had a transformative impact on our society as they have revolutionized almost all aspects of human interaction. The explosive growth of data traffic has led to an increased demand on improving the reliability, efficiency and security aspects of the systems. In this paper, we focus on the multiple access channel, a communication model where several transmitters communicate to a common receiver (e.g., a cellular telephone network) in the presence of an external eavesdropper. The goal is to explore the competitive yet cooperative relationship between the transmitters in order to obtain an efficient communication under a certain reliability and security guarantee. Moreover, we take a special look into the inner and outer bounds on the secrecy capacity regions over the 2-transmitter DM-MAC with a degraded eavesdropper (assuming that both transmitters are cooperative). We notice that the inner and outer bounds differentiate themselves in the permissible sets of input distributions and thus not tight in general. This leaves the problem of secrecy capacity regions still open.

[1]  H. Vincent Poor,et al.  Multiple Access Channels with Generalized Feedback and Confidential Messages , 2007, 2007 IEEE Information Theory Workshop.

[2]  Remi A. Chou,et al.  The Gaussian multiple access wiretap channel when the eavesdropper can arbitrarily jam , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[3]  Aydano B. Carleial,et al.  Multiple-access channels with different generalized feedback signals , 1982, IEEE Trans. Inf. Theory.

[4]  Masoud Salehi,et al.  Multiple access channels with arbitrarily correlated sources , 1980, IEEE Trans. Inf. Theory.

[5]  Moritz Wiese,et al.  Strong Secrecy for Multiple Access Channels , 2012, Information Theory, Combinatorics, and Search Theory.

[6]  Jack K. Wolf,et al.  The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[7]  G. H. Khachatrian,et al.  Code Construction for the T-User Noiseless Adder Channel , 1998, IEEE Trans. Inf. Theory.

[8]  Ender Tekin,et al.  The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.

[9]  Mohammad Reza Aref,et al.  Multiple Access Wiretap channels with strong secrecy , 2010, 2010 IEEE Information Theory Workshop.

[10]  H. Vincent Poor,et al.  Multiple-Access Channels With Confidential Messages , 2008, IEEE Transactions on Information Theory.

[11]  Cyril Leung,et al.  An achievable rate region for the multiple-access channel with feedback , 1981, IEEE Trans. Inf. Theory.

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

[13]  Frans M. J. Willems.  The feedback capacity region of a class of discrete memoryless multiple access channels , 1982, IEEE Trans. Inf. Theory.

[14]  Edward C. van der Meulen,et al.  A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

[15]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[16]  Andries P. Hekstra,et al.  Dependence balance bounds for single-output two-way channels , 1989, IEEE Trans. Inf. Theory.

[17]  A. J. Han Vinck,et al.  On the capacity of the two-user M -ary multiple-access channel with feedback , 1985, IEEE Trans. Inf. Theory.

[18]  Amos Lapidoth,et al.  An improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback , 2005, IEEE Transactions on Information Theory.

[19]  Onur Ozan Koyluoglu,et al.  On secure communication over the multiple access channel , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

[20]  Ramji Venkataramanan,et al.  A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback , 2011, IEEE Transactions on Information Theory.

[21]  A. J. Han Vinck,et al.  Collective Secrecy Over the $K$ -Transmitter Multiple Access Channel , 2018, IEEE Transactions on Information Forensics and Security.