Loading...
Imperfect and Perfect Secrecy in Compound Multiple Access Channel with Confidential Message
Zivari Fard, H ; Sharif University of Technology
418
Viewed
- Type of Document: Article
- DOI: 10.1109/TIFS.2016.2523813
- Publisher: Institute of Electrical and Electronics Engineers Inc
- Abstract:
- 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, which is only decoded by its corresponding receiver and kept secret from the other receiver. We call this proposed setting the compound MAC with a confidential message. For this model, we derive general inner and outer bounds for both imperfect and perfect secrecy conditions for the second receiver. 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 a confidential message. In addition, for the Gaussian case, we show that using cooperative jamming strategy can increase the achievable secrecy rate between the legitimate transmitter and the receiver
- Keywords:
- Compound multiple access channel ; Secrecy rate region ; Gaussian distribution ; Capacity-equivocation regions ; Imperfect secrecies ; Multiple access channels ; Outer bounds ; Perfect secrecy ; Rate regions ; Wire-tap channels ; Communication channels (information theory)
- Source: IEEE Transactions on Information Forensics and Security ; Volume 11, Issue 6 , 2016 , Pages 1239-1251 ; 15566013 (ISSN)
- URL: http://ieeexplore.ieee.org/document/7395350