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

IEEE Wireless Communications and Networking Conference

Three-user cognitive multiple-access channels with confidential messages

Amir Sonee, Ghosheh Abed Hodtani

Published Apr 1, 2016• 2 citations
Publisher

Abstract

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.

DOI
10.1109/wcnc.2016.7564681

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

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

Amir Sonee, Ghosheh Abed Hodtani

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.

Transactions on Emerging Telecommunications Technologies•May 30, 2017•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 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

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

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 Channels With Confidential Messages

Yingbin Liang, H. Vincent Poor

A discrete memoryless multiple-access channel (MAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information intended for the destination. This channel generalizes the classical MAC model in that each user also receives channel outputs, and hence may obtain the confidential information sent by the other user from the channel output it receives. However, each user views the other user as a wiretapper or eavesdropper, and wishes to keep its confidential information as secret as possible from the other user. The level of secrecy of the confidential information is measured by the equivocation rate, i.e., the entropy rate of the confidential information conditioned on channel outputs at the wiretapper (the other user). The performance measure is the rate-equivocation tuple that includes the common rate, two private rates, and two equivocation rates as components. The set that includes all achievable rate-equivocation tuples is referred to as the capacity-equivocation region. The case of perfect secrecy is particularly of interest, in which each user's confidential information is perfectly hidden from the other user. The set that includes all achievable rates with perfect secrecy is referred to as the secrecy capacity region. For the MAC with two confidential messages, in which both users have confidential messages for the destination, inner bounds on the capacity-equivocation region, and secrecy capacity region are obtained. It is demonstrated that there is a tradeoff between the two equivocation rates (secrecy levels) achieved for the two confidential messages. For the MAC with one confidential message, in which only one user (user 1) has private (confidential) information for the destination, inner and outer bounds on the capacity-equivocation region are derived. These bounds match partially, and hence the capacity-equivocation region is partially characterized. Furthermore, the outer bound provides a tight converse for the case of perfect secrecy, and hence establishes the secrecy capacity region. A class of degraded MACs with one confidential message is further studied, and the capacity-equivocation region and the secrecy capacity region are established. These results are further explored via two example channels: the binary and Gaussian MACs. For both channels, the capacity-equivocation regions and the secrecy capacity regions are obtained.

IEEE Transactions on Information Theory•Feb 29, 2008•304 citations
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.
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 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.
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.
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.
A discrete memoryless multiple-access channel (MAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information intended for the destination. This channel generalizes the classical MAC model in that each user also receives channel outputs, and hence may obtain the confidential information sent by the other user from the channel output it receives. However, each user views the other user as a wiretapper or eavesdropper, and wishes to keep its confidential information as secret as possible from the other user. The level of secrecy of the confidential information is measured by the equivocation rate, i.e., the entropy rate of the confidential information conditioned on channel outputs at the wiretapper (the other user). The performance measure is the rate-equivocation tuple that includes the common rate, two private rates, and two equivocation rates as components. The set that includes all achievable rate-equivocation tuples is referred to as the capacity-equivocation region. The case of perfect secrecy is particularly of interest, in which each user's confidential information is perfectly hidden from the other user. The set that includes all achievable rates with perfect secrecy is referred to as the secrecy capacity region. For the MAC with two confidential messages, in which both users have confidential messages for the destination, inner bounds on the capacity-equivocation region, and secrecy capacity region are obtained. It is demonstrated that there is a tradeoff between the two equivocation rates (secrecy levels) achieved for the two confidential messages. For the MAC with one confidential message, in which only one user (user 1) has private (confidential) information for the destination, inner and outer bounds on the capacity-equivocation region are derived. These bounds match partially, and hence the capacity-equivocation region is partially characterized. Furthermore, the outer bound provides a tight converse for the case of perfect secrecy, and hence establishes the secrecy capacity region. A class of degraded MACs with one confidential message is further studied, and the capacity-equivocation region and the secrecy capacity region are established. These results are further explored via two example channels: the binary and Gaussian MACs. For both channels, the capacity-equivocation regions and the secrecy capacity regions are obtained.