Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Transactions on Emerging Telecommunications Technologies

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

Amir Sonee, Ghosheh Abed Hodtani

Published May 30, 2017• 1 citation
Publisher

Abstract

Abstract In 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.

DOI
10.1002/ett.3197

Related papers

Three-user cognitive multiple-access channels with confidential messages

Amir Sonee, Ghosheh Abed Hodtani

The two-user discrete memoryless cognitive multiple-access channel with confidential messages (DM-CMAC-CM) has been studied in the literature with a result for the secrecy capacity region. In this paper, we study a more general and practical model (three-user DM-CMAC-CM), although similar generalizations have been intractable in some studied cases, and obtain a capacity-equivocation and secrecy capacity region results including previous results as its special cases.

IEEE Wireless Communications and Networking Conference Workshops (WCNCW)•Apr 1, 2016•1 citation

Fading Cognitive Multiple-Access Channels With Confidential Messages

Ruoheng Liu, Yingbin Liang, H. Vincent Poor

The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users (users 1 and 2) wish to transmit a common message to a destination and user 1 also has a confidential message intended for the destination. The two users transmit to the destination via a multiple access channel, and user 2 also receives noisy channel outputs. Such channel outputs potentially help user 2 to learn user 1's confidential information (although they are not exploited by user 2 for channel transmission). Hence, user 1 views user 2 as an eavesdropper and wishes to keep its confidential message as secret as possible from user 2. A parallel CMAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel CMAC-CM is established, which yields the secrecy capacity regions of the parallel CMAC-CM with degraded subchannels and the parallel Gaussian CMAC-CM. These results are then applied to study the fading CMAC-CM, in which both the user-to-user channel and the user-to-destination channel are corrupted by multiplicative fading gain coefficients in addition to additive white Gaussian noise. The channel state information (CSI) is assumed to be known at both the users and the destination. With the CSI, users can dynamically change their transmission powers with the channel realization to achieve the optimal performance. The closed-form power allocation function that achieves every boundary point of the secrecy capacity region is derived.

IEEE Transactions on Information Theory•Aug 1, 2011•28 citations

Fading Cognitive Multiple-Access Channels With Confidential Messages

Ruoheng Liu, Yingbin Liang, H. Vincent Poor

The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users attempt to transmit common information to a destination and user 1 also has confidential information intended for the destination. User 1 views user 2 as an eavesdropper and wishes to keep its confidential information as secret as possible from user 2. The multiple-access channel (both the user-to-user channel and the user-to-destination channel) is corrupted by multiplicative fading gain coefficients in addition to additive white Gaussian noise. The channel state information (CSI) is assumed to be known at both the users and the destination. A parallel CMAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel CMAC-CM is established, which yields the secrecy capacity region of the parallel CMAC-CM with degraded subchannels. Next, the secrecy capacity region is established for the parallel Gaussian CMAC-CM, which is used to study the fading CMAC-CM. When both users know the CSI, they can dynamically change their transmission powers with the channel realization to achieve the optimal performance. The closed-form power allocation function that achieves every boundary point of the secrecy capacity region is derived.

arXiv:0910.4613•Oct 24, 2009•2 citations

Three-user cognitive multiple-access channels with confidential messages

Amir Sonee, Ghosheh Abed Hodtani

The two-user discrete memoryless cognitive multiple-access channel with confidential messages (DM-CMAC-CM) has been studied in the literature with a result for the secrecy capacity region. In this paper, we study a more general and practical model (three-user DM-CMAC-CM), although similar generalizations have been intractable in some studied cases, and obtain a capacity-equivocation and secrecy capacity region results including previous results as its special cases.

IEEE Wireless Communications and Networking Conference•Apr 1, 2016•2 citations

The Cognitive Multiple Access Wire-Tap Channel

Osvaldo Simeone, Aylin Yener

A cognitive Multiple Access Channel with a Wire-tapper (cMAC-WT) is studied, where one of the two encoders is cognitive, in the sense that it knows a priori the message of the other encoder. Both the discrete and Gaussian models are considered. General achievable rates and outer bounds to the secrecy capacity region are derived, and the secrecy capacity region is identified for the special cases of less noisy discrete cMAC-WT, degraded Gaussian cMAC-WT and degraded Gaussian cMAC-WT with orthogonal components. Numerical results are provided to illustrate the main findings.

Conference on Information Sciences and Systems•Mar 1, 2009•23 citations

Multiple access channel with common message and secrecy constraint

Hassan ZivariFard, Bahareh Akhbari, Mahmoud Ahmadian‐Attari +1 more

The authors study the problem of secret communication over a multiple‐access channel with a common message. Here, the authors assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. The authors call this setting as multiple‐access wiretap channel with common message (MAWC‐CM). For this setting, the authors derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a special case called the switch channel. As well, for a Gaussian version of MAWC‐CM, the authors derive inner and outer bounds on the secrecy capacity region. Providing numerical results for the Gaussian case, the authors illustrate the comparison between the derived achievable rate region and the outer bound for the considered model and the capacity region of compound multiple access channel.

IET Communications•Dec 17, 2015•6 citations
Abstract In 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.
The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users (users 1 and 2) wish to transmit a common message to a destination and user 1 also has a confidential message intended for the destination. The two users transmit to the destination via a multiple access channel, and user 2 also receives noisy channel outputs. Such channel outputs potentially help user 2 to learn user 1's confidential information (although they are not exploited by user 2 for channel transmission). Hence, user 1 views user 2 as an eavesdropper and wishes to keep its confidential message as secret as possible from user 2. A parallel CMAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel CMAC-CM is established, which yields the secrecy capacity regions of the parallel CMAC-CM with degraded subchannels and the parallel Gaussian CMAC-CM. These results are then applied to study the fading CMAC-CM, in which both the user-to-user channel and the user-to-destination channel are corrupted by multiplicative fading gain coefficients in addition to additive white Gaussian noise. The channel state information (CSI) is assumed to be known at both the users and the destination. With the CSI, users can dynamically change their transmission powers with the channel realization to achieve the optimal performance. The closed-form power allocation function that achieves every boundary point of the secrecy capacity region is derived.
The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users attempt to transmit common information to a destination and user 1 also has confidential information intended for the destination. User 1 views user 2 as an eavesdropper and wishes to keep its confidential information as secret as possible from user 2. The multiple-access channel (both the user-to-user channel and the user-to-destination channel) is corrupted by multiplicative fading gain coefficients in addition to additive white Gaussian noise. The channel state information (CSI) is assumed to be known at both the users and the destination. A parallel CMAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel CMAC-CM is established, which yields the secrecy capacity region of the parallel CMAC-CM with degraded subchannels. Next, the secrecy capacity region is established for the parallel Gaussian CMAC-CM, which is used to study the fading CMAC-CM. When both users know the CSI, they can dynamically change their transmission powers with the channel realization to achieve the optimal performance. The closed-form power allocation function that achieves every boundary point of the secrecy capacity region is derived.
A cognitive Multiple Access Channel with a Wire-tapper (cMAC-WT) is studied, where one of the two encoders is cognitive, in the sense that it knows a priori the message of the other encoder. Both the discrete and Gaussian models are considered. General achievable rates and outer bounds to the secrecy capacity region are derived, and the secrecy capacity region is identified for the special cases of less noisy discrete cMAC-WT, degraded Gaussian cMAC-WT and degraded Gaussian cMAC-WT with orthogonal components. Numerical results are provided to illustrate the main findings.
The authors study the problem of secret communication over a multiple‐access channel with a common message. Here, the authors assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. The authors call this setting as multiple‐access wiretap channel with common message (MAWC‐CM). For this setting, the authors derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a special case called the switch channel. As well, for a Gaussian version of MAWC‐CM, the authors derive inner and outer bounds on the secrecy capacity region. Providing numerical results for the Gaussian case, the authors illustrate the comparison between the derived achievable rate region and the outer bound for the considered model and the capacity region of compound multiple access channel.