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

IET Communications

Multiple‐access wiretap channel with common channel state information at the encoders

Bin Dai, Yongtao Wang, Zhuojun Zhuang

Published Mar 1, 2014• 4 citations
Publisher

Abstract

The multiple‐access wiretap channel (MAC‐WTC) with common channel state information (CSI) at the encoders is studied, where two transmitters wish to send their confidential messages (no common message) to a legitimate receiver, while keeping a wiretapper as ignorant of the confidential messages as possible. Meanwhile, the channel is controlled by CSI, and it is available at the transmitters in a non‐causal manner or causal manner. This model can be viewed as a MAC extension of the WTC with CSI. Both the situation that the encoders can cooperate with each other and the situation that cooperation is not allowed between the encoders are investigated. More specifically, first, the cooperative MAC‐WTC with common CSI at the encoders is investigated, inner bounds on the secrecy capacity regions are provided for both non‐causal and causal manners. Secondly, the non‐cooperative MAC‐WTC with common CSI at the encoders is investigated, and also provide inner bounds on the secrecy capacity regions for both non‐causal and causal manners. Finally, by calculating the binary examples, the authors find that the cooperation between the encoders helps to obtain a larger secrecy rate region, that is, cooperation enhances the security of the MAC‐WTC with common CSI at the encoders.

DOI
10.1049/iet-com.2013.0630

Related papers

Discrete Memoryless Multiple-Access Wiretap Channel with Non-Cooperative Encoders

Bin Dai, Yong Tao Wang

In this paper, the discrete memoryless multiple-access wiretap channel (MAC-WT) with non-cooperative encoders is studied, where two users (cooperation between the users is not allowed) transmit their corresponding confidential messages (no common message) to a legitimate receiver, while an additional wiretapper wishes to obtain the messages via a wiretap channel. The inner and outer bounds on the capacity-equivocation region are provided forthis new model, and the result is further explained via a binary example.

Applied Mechanics and Materials•Oct 15, 2013•0 citations

Information-Theoretical Security for Several Models of Multiple-Access Channel

Bin Dai, A. J. Han Vinck, Zhuojun Zhuang +1 more

Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user obtains a degraded version of the output of the MAC. Each user views the other user as a eavesdropper, and wishes to keep its confidential message as secret as possible from the other user. Measuring each user's uncertainty about the other user's confidential message by equivocation, the inner and outer bounds on the capacity-equivocation region for this model have been provided. The result is further explained via the binary and Gaussian examples. Second, the discrete memoryless multiple-access wiretap channel (MAC-WT) is studied, where two users transmit their corresponding confidential messages (no common message) to a legitimate receiver, while an additional wiretapper wishes to obtain the messages via a wiretap channel. This new model is considered into two cases: the general MAC-WT with cooperative encoders, and the degraded MAC-WT with non-cooperative encoders. The capacity-equivocation region is totally determined for the cooperative case, and inner and outer bounds on the capacity-equivocation region are provided for the non-cooperative case. For both cases, the results are further explained via the binary examples.

arXiv:1208.1697•Aug 8, 2012•1 citation

Multiple access wiretap channel with noiseless feedback

Bin Dai, Zheng Ma

The physical layer security in the up‐link of the wireless communication systems is often modelled as the multiple access wiretap channel (MAC‐WT), and recently it has received a lot attention. In this paper, the MAC‐WT has been re‐visited by considering the situation that the legitimate receiver feeds his received channel output back to the transmitters via two noiseless channels, respectively. This model is called the MAC‐WT with noiseless feedback. Inner and outer bounds on the secrecy capacity region of this feedback model are provided. To be specific, we first present a decode‐and‐forward (DF) inner bound on the secrecy capacity region of this feedback model, and this bound is constructed by allowing each transmitter to decode the other one's transmitted message from the feedback, and then each transmitter uses the decoded message to re‐encode his own messages, i.e. this DF inner bound allows the independent transmitters to co‐operate with each other. Then, we provide a hybrid inner bound which is strictly larger than the DF inner bound, and it is constructed by using the feedback as a tool not only to allow the independent transmitters to co‐operate with each other but also to generate two secret keys, respectively, shared between the legitimate receiver and the two transmitters. Finally, we give a sato‐type outer bound on the secrecy capacity region of this feedback model. The results of this paper are further explained via a Gaussian example, and from this example, we see that the noiseless feedback helps to enhance the achievable secrecy rate region of the Gaussian MAC‐WT without feedback.

arXiv:1701.04052•IET Communications•Jul 24, 2017•3 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.

arXiv:1402.4799•IET Communications•Dec 17, 2015•7 citations

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

Fangbiao Li, Zhi Xue

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.

International Conference on Information and Network Security (ICINS)•Jan 1, 2014•0 citations

Quantum Advantage in Multiple Access Wiretap Channels with Entangled Transmitters

Hassan ZivariFard, Xiaodong Wang

We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters. Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity. We further establish a single-letter upper bound on the secure capacity of the MAC-WTC with entangled transmitters. Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness, a finding we illustrate using a pseudo-telepathy game example. Finally, we establish new strong soft-covering lemmas for the output statistics of multipleaccess channels (MACs) with entangled transmitters. Our results generalize existing results for non-entangled systems.

cs.ITCross-listedarXiv:2609.06808•IEEE Transactions on Information Theory•Sep 8, 2026•1 citation
The multiple‐access wiretap channel (MAC‐WTC) with common channel state information (CSI) at the encoders is studied, where two transmitters wish to send their confidential messages (no common message) to a legitimate receiver, while keeping a wiretapper as ignorant of the confidential messages as possible. Meanwhile, the channel is controlled by CSI, and it is available at the transmitters in a non‐causal manner or causal manner. This model can be viewed as a MAC extension of the WTC with CSI. Both the situation that the encoders can cooperate with each other and the situation that cooperation is not allowed between the encoders are investigated. More specifically, first, the cooperative MAC‐WTC with common CSI at the encoders is investigated, inner bounds on the secrecy capacity regions are provided for both non‐causal and causal manners. Secondly, the non‐cooperative MAC‐WTC with common CSI at the encoders is investigated, and also provide inner bounds on the secrecy capacity regions for both non‐causal and causal manners. Finally, by calculating the binary examples, the authors find that the cooperation between the encoders helps to obtain a larger secrecy rate region, that is, cooperation enhances the security of the MAC‐WTC with common CSI at the encoders.
In this paper, the discrete memoryless multiple-access wiretap channel (MAC-WT) with non-cooperative encoders is studied, where two users (cooperation between the users is not allowed) transmit their corresponding confidential messages (no common message) to a legitimate receiver, while an additional wiretapper wishes to obtain the messages via a wiretap channel. The inner and outer bounds on the capacity-equivocation region are provided forthis new model, and the result is further explained via a binary example.
Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user obtains a degraded version of the output of the MAC. Each user views the other user as a eavesdropper, and wishes to keep its confidential message as secret as possible from the other user. Measuring each user's uncertainty about the other user's confidential message by equivocation, the inner and outer bounds on the capacity-equivocation region for this model have been provided. The result is further explained via the binary and Gaussian examples. Second, the discrete memoryless multiple-access wiretap channel (MAC-WT) is studied, where two users transmit their corresponding confidential messages (no common message) to a legitimate receiver, while an additional wiretapper wishes to obtain the messages via a wiretap channel. This new model is considered into two cases: the general MAC-WT with cooperative encoders, and the degraded MAC-WT with non-cooperative encoders. The capacity-equivocation region is totally determined for the cooperative case, and inner and outer bounds on the capacity-equivocation region are provided for the non-cooperative case. For both cases, the results are further explained via the binary examples.
The physical layer security in the up‐link of the wireless communication systems is often modelled as the multiple access wiretap channel (MAC‐WT), and recently it has received a lot attention. In this paper, the MAC‐WT has been re‐visited by considering the situation that the legitimate receiver feeds his received channel output back to the transmitters via two noiseless channels, respectively. This model is called the MAC‐WT with noiseless feedback. Inner and outer bounds on the secrecy capacity region of this feedback model are provided. To be specific, we first present a decode‐and‐forward (DF) inner bound on the secrecy capacity region of this feedback model, and this bound is constructed by allowing each transmitter to decode the other one's transmitted message from the feedback, and then each transmitter uses the decoded message to re‐encode his own messages, i.e. this DF inner bound allows the independent transmitters to co‐operate with each other. Then, we provide a hybrid inner bound which is strictly larger than the DF inner bound, and it is constructed by using the feedback as a tool not only to allow the independent transmitters to co‐operate with each other but also to generate two secret keys, respectively, shared between the legitimate receiver and the two transmitters. Finally, we give a sato‐type outer bound on the secrecy capacity region of this feedback model. The results of this paper are further explained via a Gaussian example, and from this example, we see that the noiseless feedback helps to enhance the achievable secrecy rate region of the Gaussian MAC‐WT without feedback.
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 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.
We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters. Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity. We further establish a single-letter upper bound on the secure capacity of the MAC-WTC with entangled transmitters. Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness, a finding we illustrate using a pseudo-telepathy game example. Finally, we establish new strong soft-covering lemmas for the output statistics of multipleaccess channels (MACs) with entangled transmitters. Our results generalize existing results for non-entangled systems.