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

International Conference on Information and Network Security (ICINS)

An achievable secrecy capacity region for multiple-access wiretap channel with common message and side information

Fangbiao Li, Zhi Xue

Published Jan 1, 2014• 0 citations
Publisher

Abstract

In this paper, we study the discrete memory Multiple Access Wiretap Channel (DM-MAWC) with one common message and non-causal side information. In this channel, two transmitters send a common message to the receivers, meanwhile they both transmit an individual confidential message, which must be kept secret from the second receiver (viewed as a wiretapper) to the first receiver. As the side information is non-causally available at the transmitters, we derive the achievable perfect secrecy capacity region for the MAWC with one common message and non-casual side information available at the transmitters by using Cover's superposition coding and Gelfand-Pinsker random binning coding schemes. The achievable secrecy capacity region of this paper subsumes the region of multiple access wiretap channel with or without common message and without side information as its special cases.

DOI
10.1049/cp.2014.1265

Related papers

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.

arXiv:1402.4799•IET Communications•Dec 17, 2015•7 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

An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages

Hao Xu, Giuseppe Caire, Cunhua Pan

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver but only the confidential messages need to be protected from the eavesdropper. By using random coding, we find an achievable secrecy rate region, within which perfect secrecy can be realized, i.e., all users can communicate with the legitimate receiver with arbitrarily small probability of error, while the confidential information leaked to the eavesdropper tends to zero.

arXiv:2001.03722•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•5 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

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•300 citations

On the Secrecy Rate Region of Multiple-Access Wiretap Channel With Noncausal Side Information

Amir Sonee, Ghosheh Abed Hodtani

In this paper, we study the two transmitter multiple-access channel (MAC) with noncausal side information at one (single-sided) or both (two-sided) of the encoders in the presence of an external wiretapper (WT) and under individual and collective secrecy constraints. Our work consists of four parts. First, we consider the discrete memoryless (DM-MAC-WT) case of the model and derive inner and outer bounds on the secrecy capacity region under both of the secrecy constraints. Second, the results are extended to the Gaussian memoryless case [Gaussian multiple-access channel WT (GMAC-WT)] in detail and are used to illustrate numerically that the secrecy rate region is enlarged by increasing the power of the interference signal which is known noncausally at the encoder. Third, we analyze the strong interference regime as an important regime in GMAC with side information and show that under collective secrecy constraint, we can achieve the secrecy capacity region of the single-sided channel asymptotically for a special case in which the signal and noise powers satisfy specific constraints. To the best of our knowledge, this capacity region is the first one obtained for GMAC-WT. Finally, we show that our results include previous works as its special cases for both the single-sided and two-sided channel models.

IEEE Transactions on Information Forensics and Security•Feb 5, 2015•13 citations
In this paper, we study the discrete memory Multiple Access Wiretap Channel (DM-MAWC) with one common message and non-causal side information. In this channel, two transmitters send a common message to the receivers, meanwhile they both transmit an individual confidential message, which must be kept secret from the second receiver (viewed as a wiretapper) to the first receiver. As the side information is non-causally available at the transmitters, we derive the achievable perfect secrecy capacity region for the MAWC with one common message and non-casual side information available at the transmitters by using Cover's superposition coding and Gelfand-Pinsker random binning coding schemes. The achievable secrecy capacity region of this paper subsumes the region of multiple access wiretap channel with or without common message and without side information as its special cases.
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.
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.
This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver but only the confidential messages need to be protected from the eavesdropper. By using random coding, we find an achievable secrecy rate region, within which perfect secrecy can be realized, i.e., all users can communicate with the legitimate receiver with arbitrarily small probability of error, while the confidential information leaked to the eavesdropper tends to zero.
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.
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.
In this paper, we study the two transmitter multiple-access channel (MAC) with noncausal side information at one (single-sided) or both (two-sided) of the encoders in the presence of an external wiretapper (WT) and under individual and collective secrecy constraints. Our work consists of four parts. First, we consider the discrete memoryless (DM-MAC-WT) case of the model and derive inner and outer bounds on the secrecy capacity region under both of the secrecy constraints. Second, the results are extended to the Gaussian memoryless case [Gaussian multiple-access channel WT (GMAC-WT)] in detail and are used to illustrate numerically that the secrecy rate region is enlarged by increasing the power of the interference signal which is known noncausally at the encoder. Third, we analyze the strong interference regime as an important regime in GMAC with side information and show that under collective secrecy constraint, we can achieve the secrecy capacity region of the single-sided channel asymptotically for a special case in which the signal and noise powers satisfy specific constraints. To the best of our knowledge, this capacity region is the first one obtained for GMAC-WT. Finally, we show that our results include previous works as its special cases for both the single-sided and two-sided channel models.