On the secrecy capacity region of 3‐user cognitive multiple‐access channels with confidential messages

Abstract

AbstractIn this paper, we study 3‐user cognitive multiple‐access channel with confidential messages (CMAC‐CM) under the perfect secrecy criterion and for the overlay paradigm. In this channel model, each cognitive user has access to the knowledge of the corresponding noncognitive users' codebooks or messages to improve the reliable communication of noncognitive users. Also, each cognitive user wishes to transmit its own message to the intended receiver in a perfectly secure manner from the corresponding noncognitive users that try to obtain information about this message by exploiting outputs from the underlying channel. For the discrete alphabet and memoryless model of this channel, known as 3‐user DM‐CMAC‐CM, first, we obtain an inner bound and an outer bound on the secrecy capacity region, and second, we prove that these bounds meet for a class of less noisy eavesdropping channels. Third, an inner bound on the secrecy capacity region of the Gaussian version of CMAC‐CM, known as GCMAC‐CM, is obtained, and fourth, it is shown that this inner bound is optimal under a special security situation for which the secrecy capacity region as well as the secrecy sum‐capacity of a class of degraded 3‐user GCMAC‐CM is proposed. Finally, by numerical analysis, we validate the theoretical results and illustrate that our model and results include the previous ones.