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

Conference on Information Sciences and Systems

The Cognitive Multiple Access Wire-Tap Channel

Osvaldo Simeone, Aylin Yener

Published Mar 1, 2009• 23 citations
Publisher

Abstract

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.

DOI
10.1109/ciss.2009.5054709

Related papers

The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints

Ender Tekin, Aylin Yener

We consider the Gaussian multiple access wire-tap channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define a suitable security measure for this multi-access environment. We derive an outer bound for the rate region such that secrecy to some pre-determined degree can be maintained. We also find, using Gaussian codebooks, an achievable such secrecy region. Gaussian codewords are shown to achieve the sum capacity outer bound, and the achievable region coincides with the outer bound for Gaussian codewords, giving the capacity region when inputs are constrained to be Gaussian. We present numerical results showing the new rate region and compare it with that of the Gaussian multiple-access channel (GMAC) with no secrecy constraints

arXiv:cs/0605023•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•52 citations

Multiple Access Wire-tap Channel with Common Message.

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

In this paper, we study the problem of secret communication over a Multiple Access Wire-tap Channel with Common Message. In this channel, we assume that two transmitters have confidential messages which must be kept secret from the eavesdropper (receiver 2), and both of them have a common message which can be decoded by two receivers. For this setting, in the discrete memoryless case we derive general inner and outer bounds on the secrecy capacity region. Also, we derive inner and outer bounds on the secrecy capacity region for the Gaussian case. Providing numerical examples for the Gaussian case, we illustrate the comparison between derived achievable rate regions, outer bounds and the capacity region of compound multiple access channel.

•Feb 19, 2014•0 citations

On Secure Signaling for the Gaussian Multiple Access Wire-tap Channel

Ender Tekin, Semih Serbetli, Aylin Yener

Abstract — We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT) where multiple users communicate with the intended receiver in the presence of an intelligent and informed wire-tapper (eavesdropper). The wire-tapper receives a degraded version of the signal at the receiver. We assume that the wire-tapper is as capable as the intended receiver, and there is no other shared secret key. We consider two different secure communication scenarios: (i) keeping the wire-tapper totally ignorant of the message of any group of users even if the remaining users are compromised, (ii) using the secrecy of the other users to ensure secrecy for a group of users. We first derive the outer bounds for the secure rate region. Next, using Gaussian codebooks, we show the achievability of a secure rate region for each measure in which the wire-tapper is kept perfectly ignorant of the messages. We also find the power allocations that yield the maximum sum rate, and show that upper bound on the secure sum rate can be achieved by a TDMA scheme. We present numerical results showing the new rate region and compare it with that of the Gaussian Multiple-Access Channel (GMAC) with no secrecy constraints. I.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Mar 22, 2006•51 citations

On the Secrecy Capacity Region of Multiple Access Wire-tap Channel with Common Message

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

In this paper, we study the problem of secret communication over a Multiple Access Wire-tap Channel with Common Message. Here, we assume that two transmitters have confidential messages which must be kept secret from the eavesdropper (the second receiver), and both of them have access to a common message which can be decoded by two receivers. For this setting, we derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case as well as for Gaussian one. Providing numerical examples for the Gaussian case, we illustrate the comparison between derived achievable rate regions and outer bounds for our considered model and the capacity region of compound multiple access channel.

arXiv:1402.4799?context=math•Feb 19, 2014•0 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 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
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.
We consider the Gaussian multiple access wire-tap channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define a suitable security measure for this multi-access environment. We derive an outer bound for the rate region such that secrecy to some pre-determined degree can be maintained. We also find, using Gaussian codebooks, an achievable such secrecy region. Gaussian codewords are shown to achieve the sum capacity outer bound, and the achievable region coincides with the outer bound for Gaussian codewords, giving the capacity region when inputs are constrained to be Gaussian. We present numerical results showing the new rate region and compare it with that of the Gaussian multiple-access channel (GMAC) with no secrecy constraints
In this paper, we study the problem of secret communication over a Multiple Access Wire-tap Channel with Common Message. In this channel, we assume that two transmitters have confidential messages which must be kept secret from the eavesdropper (receiver 2), and both of them have a common message which can be decoded by two receivers. For this setting, in the discrete memoryless case we derive general inner and outer bounds on the secrecy capacity region. Also, we derive inner and outer bounds on the secrecy capacity region for the Gaussian case. Providing numerical examples for the Gaussian case, we illustrate the comparison between derived achievable rate regions, outer bounds and the capacity region of compound multiple access channel.
Abstract — We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT) where multiple users communicate with the intended receiver in the presence of an intelligent and informed wire-tapper (eavesdropper). The wire-tapper receives a degraded version of the signal at the receiver. We assume that the wire-tapper is as capable as the intended receiver, and there is no other shared secret key. We consider two different secure communication scenarios: (i) keeping the wire-tapper totally ignorant of the message of any group of users even if the remaining users are compromised, (ii) using the secrecy of the other users to ensure secrecy for a group of users. We first derive the outer bounds for the secure rate region. Next, using Gaussian codebooks, we show the achievability of a secure rate region for each measure in which the wire-tapper is kept perfectly ignorant of the messages. We also find the power allocations that yield the maximum sum rate, and show that upper bound on the secure sum rate can be achieved by a TDMA scheme. We present numerical results showing the new rate region and compare it with that of the Gaussian Multiple-Access Channel (GMAC) with no secrecy constraints. I.
In this paper, we study the problem of secret communication over a Multiple Access Wire-tap Channel with Common Message. Here, we assume that two transmitters have confidential messages which must be kept secret from the eavesdropper (the second receiver), and both of them have access to a common message which can be decoded by two receivers. For this setting, we derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case as well as for Gaussian one. Providing numerical examples for the Gaussian case, we illustrate the comparison between derived achievable rate regions and outer bounds for our considered model and the capacity region of compound multiple access channel.
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.