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

arXiv:0910.4613

Fading Cognitive Multiple-Access Channels With Confidential Messages

Ruoheng Liu, Yingbin Liang, H. Vincent Poor

Published Oct 24, 2009• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.0910.4613

Related papers

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 (MAC-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 MAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel MAC-CM is established, which gives the secrecy capacity region of the parallel MAC-CM with degraded subchannels. Next, the secrecy capacity region is established for the parallel Gaussian MAC-CM, which is used to study the fading MAC-CM. By assuming both users know the CSI, users can dynamically change their transmission power with the channel realization to achieve the best performance.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2009•3 citations

Secure Communication Over Fading Channels

Yingbin Liang, H. Vincent Poor, Shlomo Shitz Shamai

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established, which gives the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long-term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derived that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.

IEEE Transactions on Information Theory•May 29, 2008•936 citations

Secure Communication over Fading Channels

Yingbin Liang, H. Vincent Poor, Shamai, Shlomo

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. Both the ergodic and outage performances are studied.

arXiv:cs/0701024•Allerton Conference on Communication, Control, and Computing•Jan 4, 2007•69 citations

Secrecy Capacity Region of Fading Broadcast Channels

Yingbin Liang, H. Vincent Poor, Shlomo Shitz Shamai

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.

arXiv:0707.1470•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•37 citations

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
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.
The fading cognitive multiple-access channel with confidential messages (MAC-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 MAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel MAC-CM is established, which gives the secrecy capacity region of the parallel MAC-CM with degraded subchannels. Next, the secrecy capacity region is established for the parallel Gaussian MAC-CM, which is used to study the fading MAC-CM. By assuming both users know the CSI, users can dynamically change their transmission power with the channel realization to achieve the best performance.
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established, which gives the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long-term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derived that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. Both the ergodic and outage performances are studied.
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.
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.