Compound multiple access channel with confidential messages

Zivari Fard, H ; Sharif University of Technology

543 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICC.2014.6883604
  3. Abstract:
  4. In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver and kept secret from the other receiver. For this proposed setting (compound MAC with confidential messages), we derive general inner and outer bounds on the secrecy capacity region. Also, as examples, we investigate 'Less noisy' and 'Gaussian' versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providing numerical examples for the Gaussian case, we illustrate the comparison between achievable rate regions of compound MAC and compound MAC with confidential messages
  5. Keywords:
  6. Communication ; Achievable rate region ; Confidential message ; Less noisy ; Memoryless ; Multiple access channels ; Outer bounds ; Secrecy capacity regions ; Secret communications ; Communication channels (information theory)
  7. Source: 2014 IEEE International Conference on Communications, ICC 2014 ; 10-14 June 2014 , 2014 , Pages 1922-1927 ; ISBN: 9781479920037
  8. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6883604&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6883604