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

Effects of cooperation on the secrecy of multiple access channels with generalized feedback

Ersen Ekrem, Şennur Ulukuş

Published Mar 1, 2008• 53 citations
Publisher

Abstract

We investigate the effects of user cooperation on the secrecy of multiple access channels with generalized feedback (MAC-GF). We show that cooperation can increase the achievable secrecy region. We propose achievable schemes which use compress-and-forward (CAF) based transmission strategies. CAF based strategies allow users to increase their rates up to levels which are not decodable by the cooperating partners, consequently improving the secrecy of the users. We also provide outer bounds on the achievable equivocation rates. The outer bounds we derive depend only on the channel inputs and outputs, and hence, are easily computable. Finally, we specialize our results to a Gaussian MAC-GF, and present numerical results which demonstrate the beneficial effects of cooperation on secrecy.

DOI
10.1109/ciss.2008.4558628

Related papers

Secrecy in cooperative relay broadcast channels

Ersen Ekrem, Şennur Ulukuş

We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Martonpsilas coding scheme for broadcast channels and Cover and El Gamalpsilas compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•47 citations

Secrecy in Cooperative Relay Broadcast Channels

Ersen Ekrem, Şennur Ulukuş

We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.

arXiv:0811.1317•Nov 9, 2008•3 citations

Secrecy in Cooperative Relay Broadcast Channels

Ersen Ekrem, Şennur Ulukuş

We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.

IEEE Transactions on Information Theory•Dec 29, 2010•156 citations

Multiple Access Channels with Generalized Feedback and Confidential Messages

Xiaojun Tang, Ruoheng Liu, Predrag Spasojević +1 more

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper. In this setting, an active cooperation between two trusted users is enabled through using channel feedback in order to improve the communication efficiency. Based on rate-splitting and decode-and-forward strategies, achievable secrecy rate regions are derived for both discrete memoryless and Gaussian channels. Results show that channel feedback improves the achievable secrecy rates.

arXiv:0706.3753•IEEE Information Theory Workshop (ITW)•Sep 1, 2007•57 citations

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

The multiple access channel with an untrusted relay

Ahmed A. Zewail, Aylin Yener

This paper considers a Gaussian multiple access channel aided by a relay. Specifically, the relay facilitates communication between multiple sources and a destination to which the sources have no direct link. In this set up, the relay node is considered to be untrusted, i.e., honest but curious, from whom the source messages need to be kept secret. We identify an achievable secrecy rate region utilizing cooperative jamming from the destination, and using compress-and-forward at the relay. Additionally, an outer bound on the secrecy rate region is derived. Numerical results indicate that the outer bound is tight in some cases of interest.

IEEE Information Theory Workshop (ITW)•Nov 1, 2014•5 citations
We investigate the effects of user cooperation on the secrecy of multiple access channels with generalized feedback (MAC-GF). We show that cooperation can increase the achievable secrecy region. We propose achievable schemes which use compress-and-forward (CAF) based transmission strategies. CAF based strategies allow users to increase their rates up to levels which are not decodable by the cooperating partners, consequently improving the secrecy of the users. We also provide outer bounds on the achievable equivocation rates. The outer bounds we derive depend only on the channel inputs and outputs, and hence, are easily computable. Finally, we specialize our results to a Gaussian MAC-GF, and present numerical results which demonstrate the beneficial effects of cooperation on secrecy.
We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Martonpsilas coding scheme for broadcast channels and Cover and El Gamalpsilas compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.
We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.
We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.
This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper. In this setting, an active cooperation between two trusted users is enabled through using channel feedback in order to improve the communication efficiency. Based on rate-splitting and decode-and-forward strategies, achievable secrecy rate regions are derived for both discrete memoryless and Gaussian channels. Results show that channel feedback improves the achievable secrecy rates.
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.
This paper considers a Gaussian multiple access channel aided by a relay. Specifically, the relay facilitates communication between multiple sources and a destination to which the sources have no direct link. In this set up, the relay node is considered to be untrusted, i.e., honest but curious, from whom the source messages need to be kept secret. We identify an achievable secrecy rate region utilizing cooperative jamming from the destination, and using compress-and-forward at the relay. Additionally, an outer bound on the secrecy rate region is derived. Numerical results indicate that the outer bound is tight in some cases of interest.