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 Information Theory Workshop (ITW)

Multiple Access Wiretap channels with strong secrecy

Mohammad Hossein Yassaee, Mohammad Reza Aref

Published Aug 1, 2010• 73 citations
Publisher

Abstract

The problem of secure communication over Multiple-Access Wiretap channel (MAC-WTC) under strong secrecy criterion is investigated. A new technique based on channel output statistics approximation is developed for establishing the strong security over multi-user channels. In particular, this technique shows that how simple wiretap coding results in secure communication under strong secrecy criterion instead of weak secrecy criterion. As a side result of the paper, two results on the output statistics of MAC are provided. Such results can be used to approximate the mutual information between input and output of MAC with respect to a given codebook of arbitrary rate.

DOI
10.1109/cig.2010.5592953

Related papers

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

Secrecy Rate Region Enhancement in Multiple Access Wiretap Channel

Shahid Mehraj Shah

It is commonly known that physical layer security is achieved with a trade-off in terms of the achievable rate. Hence, security constraints generate rate losses in wiretap channels. To mitigate such rate losses in multi-user channels, we propose a coding/decoding scheme for multi-user multiple access wiretap channel (MAC-WT), where previously transmitted messages are used as a secret key to enhance the secrecy rates of the transmitting users, until the usual Shannon capacity region of a multiple access channel (MAC) is achieved without the secrecy constraint. With this coding scheme, all messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal, we introduce secret key buffers at both the users and the legitimate receiver. Finally, we consider a fading MAC-WT and show that with this coding/decoding scheme, we can achieve the capacity region of a fading MAC channel (in the ergodic sense).

Journal of Telecommunications and Information Technology•Jun 30, 2022•1 citation

Strongly Secure Communications Over the Two-Way Wiretap Channel

Alexandre J. Pierrot, Matthieu R. Bloch

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the eavesdropper's terminal and cooperation between legitimate users. We leverage the notion of channel resolvability for the multiple-access channel to analyze cooperative jamming and we show that the artificial noise created by cooperative jamming induces a source of common randomness that can be used for secret-key agreement. We illustrate the gain provided by this coding technique in the case of the Gaussian two-way wiretap channel, and we show significant improvements for some channel configurations.

arXiv:1010.0177•IEEE Transactions on Information Forensics and Security•Jun 7, 2011•70 citations

Output Statistics of Random Binning for Multiple Access Channels and Strong Secrecy

Emmanouil M. Athanasakos

We consider utilizing the novel framework of output statistics of random binning, for proving achievability for communication over a multiple access channel. This framework uses the random binning technique while relying on the duality between channel and source coding problems. In particular, we provide the achievable rate region through a series of probability mass functions approximation arguments and consider randomness as an explicit random variable. Moreover, we analyze the wiretap version of the multiple access channel and prove that the strong secrecy criterion can be satisfied and an operational coding scheme can be designed by relying on the output statistics.

International Conference on Advanced Communication Technologies and Networking (CommNet)•Dec 3, 2021•0 citations

Achievable Region of the K-User MAC Wiretap Channel Under Strong Secrecy

Hao Xu, Kai‐Kit Wong, Giuseppe Caire

This paper investigates the information-theoretic secrecy problem for a K-user discrete memoryless (DM) multiple-access wiretap (MAC-WT) channel. Instead of using the weak secrecy criterion characterized by information leakage rate, we adopt the strong secrecy metric defined by information leakage to better protect the confidential information. We provide an achievable rate region and prove its achievability by providing a coding scheme and analyzing the output statistics in terms of (average) variational distance. We show that the rate region obtained in previous works on the subject is a special case of ours. We also show that the achievability proof in such works is incomplete, because it is assumed that certain inequalities hold while they may not in some cases. We solve this problem by constructing an inequality structure for the rates of all users’ secret and redundant messages, and analyzing the conditions required to maintain this structure.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•4 citations

On secure communication over multiple access wiretap channels under channel uncertainty

Rafael F. Schaefer, H. Vincent Poor

The problem of secure communication over a multiple access wiretap channel (MAWC) is studied. Here, two transmitters send confidential messages to a legitimate receiver while keeping a non-legitimate eavesdropper ignorant of them. In this paper, this communication scenario is studied for compound channels, for which it is only known to the users that the actual channel realization is fixed and belongs to a known set of possible channels. The criterion of strong secrecy is analyzed and its impact on the decoding performance of the eavesdropper is specified. It is shown that the average decoding error at the eavesdropper approaches one exponentially fast regardless of the applied decoding strategy. Furthermore, an achievable strong secrecy rate region is presented and a multi-letter outer bound is derived. Both together establish a multi-letter description of the strong secrecy capacity region.

IEEE Conference on Communications and Network Security•Oct 1, 2014•4 citations
The problem of secure communication over Multiple-Access Wiretap channel (MAC-WTC) under strong secrecy criterion is investigated. A new technique based on channel output statistics approximation is developed for establishing the strong security over multi-user channels. In particular, this technique shows that how simple wiretap coding results in secure communication under strong secrecy criterion instead of weak secrecy criterion. As a side result of the paper, two results on the output statistics of MAC are provided. Such results can be used to approximate the mutual information between input and output of MAC with respect to a given codebook of arbitrary rate.
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.
It is commonly known that physical layer security is achieved with a trade-off in terms of the achievable rate. Hence, security constraints generate rate losses in wiretap channels. To mitigate such rate losses in multi-user channels, we propose a coding/decoding scheme for multi-user multiple access wiretap channel (MAC-WT), where previously transmitted messages are used as a secret key to enhance the secrecy rates of the transmitting users, until the usual Shannon capacity region of a multiple access channel (MAC) is achieved without the secrecy constraint. With this coding scheme, all messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal, we introduce secret key buffers at both the users and the legitimate receiver. Finally, we consider a fading MAC-WT and show that with this coding/decoding scheme, we can achieve the capacity region of a fading MAC channel (in the ergodic sense).
We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the eavesdropper's terminal and cooperation between legitimate users. We leverage the notion of channel resolvability for the multiple-access channel to analyze cooperative jamming and we show that the artificial noise created by cooperative jamming induces a source of common randomness that can be used for secret-key agreement. We illustrate the gain provided by this coding technique in the case of the Gaussian two-way wiretap channel, and we show significant improvements for some channel configurations.
We consider utilizing the novel framework of output statistics of random binning, for proving achievability for communication over a multiple access channel. This framework uses the random binning technique while relying on the duality between channel and source coding problems. In particular, we provide the achievable rate region through a series of probability mass functions approximation arguments and consider randomness as an explicit random variable. Moreover, we analyze the wiretap version of the multiple access channel and prove that the strong secrecy criterion can be satisfied and an operational coding scheme can be designed by relying on the output statistics.
This paper investigates the information-theoretic secrecy problem for a K-user discrete memoryless (DM) multiple-access wiretap (MAC-WT) channel. Instead of using the weak secrecy criterion characterized by information leakage rate, we adopt the strong secrecy metric defined by information leakage to better protect the confidential information. We provide an achievable rate region and prove its achievability by providing a coding scheme and analyzing the output statistics in terms of (average) variational distance. We show that the rate region obtained in previous works on the subject is a special case of ours. We also show that the achievability proof in such works is incomplete, because it is assumed that certain inequalities hold while they may not in some cases. We solve this problem by constructing an inequality structure for the rates of all users’ secret and redundant messages, and analyzing the conditions required to maintain this structure.
The problem of secure communication over a multiple access wiretap channel (MAWC) is studied. Here, two transmitters send confidential messages to a legitimate receiver while keeping a non-legitimate eavesdropper ignorant of them. In this paper, this communication scenario is studied for compound channels, for which it is only known to the users that the actual channel realization is fixed and belongs to a known set of possible channels. The criterion of strong secrecy is analyzed and its impact on the decoding performance of the eavesdropper is specified. It is shown that the average decoding error at the eavesdropper approaches one exponentially fast regardless of the applied decoding strategy. Furthermore, an achievable strong secrecy rate region is presented and a multi-letter outer bound is derived. Both together establish a multi-letter description of the strong secrecy capacity region.