Achievable Regions and Precoder Designs for the Multiple Access Wiretap Channels With Confidential and Open Messages

Uloženo v:
Podrobná bibliografie
Název: Achievable Regions and Precoder Designs for the Multiple Access Wiretap Channels With Confidential and Open Messages
Autoři: Hao Xu, Tianyu Yang, Kai-Kit Wong, Giuseppe Caire
Zdroj: IEEE Journal on Selected Areas in Communications
Publication Status: Preprint
Informace o vydavateli: Institute of Electrical and Electronics Engineers (IEEE), 2022.
Rok vydání: 2022
Témata: Discrete memoryless (DM) multiple access wiretap (MAC-WT) channel, FOS: Computer and information sciences, Gaussian vector (GV) MAC-WT channel, open message, precoder design, Computer Science - Information Theory, Information Theory (cs.IT), 0202 electrical engineering, electronic engineering, information engineering, achievable rate region, 02 engineering and technology, confidential message
Popis: This paper investigates the secrecy capacity region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver (or Bob for brevity) but only the confidential messages need to be protected from the eavesdropper (Eve). We first consider a discrete memoryless (DM) MAC-WT channel where both Bob and Eve jointly decode their interested messages. By using random coding, we find an achievable rate region, within which perfect secrecy can be realized, i.e., all users can communicate with Bob with arbitrarily small probability of error, while the confidential information leaked to Eve tends to zero. Due to the high implementation complexity of joint decoding, we also consider the DM MAC-WT channel where Bob simply decodes messages independently while Eve still applies joint decoding. We then extend the results in the DM case to a Gaussian vector (GV) MAC-WT channel. Based on the information theoretic results, we further maximize the sum secrecy rate of the GV MAC-WT system by designing precoders for all users. Since the problems are non-convex, we provide iterative algorithms to obtain suboptimal solutions. Simulation results show that compared with existing schemes, secure communication can be greatly enhanced by the proposed algorithms, and in contrast to the works which only focus on the network secrecy performance, the system spectrum efficiency can be effectively improved since open messages can be simultaneously transmitted.
19 pages, 12 figures
Druh dokumentu: Article
ISSN: 1558-0008
0733-8716
DOI: 10.1109/jsac.2022.3145916
DOI: 10.48550/arxiv.2107.14163
Přístupová URL adresa: http://arxiv.org/pdf/2107.14163
http://arxiv.org/abs/2107.14163
https://discovery-pp.ucl.ac.uk/id/eprint/10141357/
Rights: IEEE Copyright
arXiv Non-Exclusive Distribution
Přístupové číslo: edsair.doi.dedup.....3e7a8c279ac6b132bca97a0ec1b4d8c7
Databáze: OpenAIRE
Popis
Abstrakt:This paper investigates the secrecy capacity region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver (or Bob for brevity) but only the confidential messages need to be protected from the eavesdropper (Eve). We first consider a discrete memoryless (DM) MAC-WT channel where both Bob and Eve jointly decode their interested messages. By using random coding, we find an achievable rate region, within which perfect secrecy can be realized, i.e., all users can communicate with Bob with arbitrarily small probability of error, while the confidential information leaked to Eve tends to zero. Due to the high implementation complexity of joint decoding, we also consider the DM MAC-WT channel where Bob simply decodes messages independently while Eve still applies joint decoding. We then extend the results in the DM case to a Gaussian vector (GV) MAC-WT channel. Based on the information theoretic results, we further maximize the sum secrecy rate of the GV MAC-WT system by designing precoders for all users. Since the problems are non-convex, we provide iterative algorithms to obtain suboptimal solutions. Simulation results show that compared with existing schemes, secure communication can be greatly enhanced by the proposed algorithms, and in contrast to the works which only focus on the network secrecy performance, the system spectrum efficiency can be effectively improved since open messages can be simultaneously transmitted.<br />19 pages, 12 figures
ISSN:15580008
07338716
DOI:10.1109/jsac.2022.3145916