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 ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS)

MAC with Partially Cooperating Encoders and Security Constraints

Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendorpe

Published Jan 1, 2012• 0 citations
Publisher

Abstract

We study a special case of Willems's two-user multiaccess channel with partially cooperating encoders from security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference, Encoder 2 does not transmit any message, and there is an additional
DOI
10.4108/icst.valuetools.2011.245784

Related papers

Multiaccess Channel With Partially Cooperating Encoders and Security Constraints

Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendorpe

We study a special case of Willems's two-user multiaccess channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference; Encoder 2 does not transmit any message, and there is an additional passive eavesdropper from whom the communication should be kept secret. For the discrete memoryless (DM) case, we establish inner and outer bounds on the capacity-equivocation region. The inner bound is based on a combination of Willems's coding scheme, noise injection, and additional binning that provides randomization for security. For the memoryless Gaussian model, we establish lower and upper bounds on the secrecy capacity. We also show that, under certain conditions, these bounds agree in some extreme cases of cooperation between the encoders. We illustrate our results through some numerical examples.

arXiv:1205.6852•IEEE Transactions on Information Forensics and Security•May 17, 2013•41 citations

On multiaccess channel with unidirectional cooperation and security constraints

Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendorpe

We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in the following aspects - only one encoder, Encoder 1, is allowed to conference, Encoder 2 does not transmit any message, and there is an additional passive eavesdropper from whom the communication should be kept secret. For the discrete memoryless (DM) case, we establish inner and outer bounds on the capacity-equivocation region. The inner bound is established by a careful combination of Willems's coding scheme, noise injection scheme and additional binning that provides randomization for security. For the memoryless Gaussian model, we establish lower and upper bounds on the secrecy capacity. We also studied some extreme cases of cooperation between the encoders and showed that, under certain conditions, these bounds coincide.

Allerton Conference on Communication, Control, and Computing•Oct 1, 2012•9 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

Rate Regions for Multiple Access Channel With Conference and Secrecy Constraints

Peng Xu, Zhiguo Ding, Xuchu Dai

This paper studies the impact of partial encoder cooperation on the secrecy of the multiple access channel (MAC) with an external eavesdropper. In particular, two encoders, connected by two communication links with finite capacities, wish to send secret messages to the common intended decoder in the presence of a passive eavesdropper. The inner and outer bounds on the secrecy capacity are derived for the discrete memoryless channel. The derived inner bound rate region is achievable by combining Willems's coding for the MAC with partially cooperating encoders and Wyner's random binning for the wiretap channel. Then, both the inner and outer bounds are extended to the Gaussian case and the corresponding rate regions are established. Several simple achievable transmission schemes are proposed for the Gaussian channel and the numerical results show that the partial encoder cooperation can increase the achievable rate regions.

IEEE Transactions on Information Forensics and Security•Sep 20, 2013•23 citations

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

Cooperation for the classical-quantum multiple access channel

Holger Boche, Janis Nötzel

We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common message), the two senders each have their private messages, but would also like to transmit common messages. In the second scenario (ccq-MAC with conferencing encoders), each sender has its own set of messages, but they are allowed to use a limited amount of noiseless classical communication amongst each other prior to encoding their messages. This conferencing protocol may depend on each individual message they intend to send. The two scenarios are related to each other not only in spirit - the existence of a capacity-achieving construction scheme for codes for the ccq-MAC with common messages is used for proving the existence of another such scheme for the ccq-MAC with conferencing encoders.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•1 citation
We study a special case of Willems's two-user multiaccess channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference; Encoder 2 does not transmit any message, and there is an additional passive eavesdropper from whom the communication should be kept secret. For the discrete memoryless (DM) case, we establish inner and outer bounds on the capacity-equivocation region. The inner bound is based on a combination of Willems's coding scheme, noise injection, and additional binning that provides randomization for security. For the memoryless Gaussian model, we establish lower and upper bounds on the secrecy capacity. We also show that, under certain conditions, these bounds agree in some extreme cases of cooperation between the encoders. We illustrate our results through some numerical examples.
We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in the following aspects - only one encoder, Encoder 1, is allowed to conference, Encoder 2 does not transmit any message, and there is an additional passive eavesdropper from whom the communication should be kept secret. For the discrete memoryless (DM) case, we establish inner and outer bounds on the capacity-equivocation region. The inner bound is established by a careful combination of Willems's coding scheme, noise injection scheme and additional binning that provides randomization for security. For the memoryless Gaussian model, we establish lower and upper bounds on the secrecy capacity. We also studied some extreme cases of cooperation between the encoders and showed that, under certain conditions, these bounds coincide.
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.
This paper studies the impact of partial encoder cooperation on the secrecy of the multiple access channel (MAC) with an external eavesdropper. In particular, two encoders, connected by two communication links with finite capacities, wish to send secret messages to the common intended decoder in the presence of a passive eavesdropper. The inner and outer bounds on the secrecy capacity are derived for the discrete memoryless channel. The derived inner bound rate region is achievable by combining Willems's coding for the MAC with partially cooperating encoders and Wyner's random binning for the wiretap channel. Then, both the inner and outer bounds are extended to the Gaussian case and the corresponding rate regions are established. Several simple achievable transmission schemes are proposed for the Gaussian channel and the numerical results show that the partial encoder cooperation can increase the achievable rate regions.
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.
We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common message), the two senders each have their private messages, but would also like to transmit common messages. In the second scenario (ccq-MAC with conferencing encoders), each sender has its own set of messages, but they are allowed to use a limited amount of noiseless classical communication amongst each other prior to encoding their messages. This conferencing protocol may depend on each individual message they intend to send. The two scenarios are related to each other not only in spirit - the existence of a capacity-achieving construction scheme for codes for the ccq-MAC with common messages is used for proving the existence of another such scheme for the ccq-MAC with conferencing encoders.