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 Transactions on Information Theory

Secrecy in Cooperative Relay Broadcast Channels

Ersen Ekrem, Şennur Ulukuş

Published Dec 29, 2010• 156 citations
Publisher

Abstract

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.

DOI
10.1109/tit.2010.2090215

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 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 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

Cooperation with an untrusted relay in broadcast channels

Liang Chen

This paper studies secure communication over the broadcast channels with an untrusted relay. The relay helps users with transmission in broadcast channels, but we also wish to keep the information secret against the relay. Compress-and-forward relaying is a potential strategy to achieve secrecy. We obtain the achievable rate-equivocation regions by combining it with Marton's coding scheme and Cover's superposition coding scheme respectively. The secrecy rate region based on Marton's coding scheme provides a general result, without knowing information regarding two users. If we know which user is better (i.e. receiving more information), we can design a simpler scheme with superposition encoding. Outer bound to the rate-equivocation regions is also provided in this paper.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•2 citations

Relay Broadcast Channels with Confidential Messages.

Bin Dai, Zheng Ma

We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable secrecy rate region of the broadcast channels with confidential messages. More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized noise-forward and compress-forward strategies) and an outer bound on the capacity-equivocation region are provided. Removing the secrecy constraint, this outer bound can also be served as a new outer bound for the relay broadcast channel. Second, we investigate the discrete memoryless relay broadcast channels with two confidential messages (no common message). Inner and outer bounds on the capacity-equivocation region are provided. Then, we study the Gaussian case, and find that with the help of the relay node, the achievable secrecy rate region of the Gaussian broadcast channels with two confidential messages is enhanced. Finally, we investigate the discrete memoryless relay broadcast channels with one confidential message and one common message. This work generalizes Lai-Gamals work on the relay-eavesdropper channel by considering an additional common message for both the legitimate receiver and the eavesdropper. Inner and outer bounds on the capacity-equivocation region are provided, and the results are further explained via a Gaussian example. Compared with Csiszár-Körner’s work on broadcast channels with confidential messages (BCC), we find that with the help of the relay node, the secrecy capacity region of the Gaussian BCC is enhanced.

•Dec 24, 2013•0 citations

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

Ersen Ekrem, Şennur Ulukuş

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.

Conference on Information Sciences and Systems•Mar 1, 2008•53 citations

Rate regions and secrecy rate regions of cooperative relay networks

Liang Chen

This paper studies the transmission rates and physical layer security of cooperative relay networks. For any relay network, there are natural information theoretic cut-set bounds, which upper bound the transmission rates. We further tighten the outer bounds on rate regions. We also study the achievable rate regions in consideration of physical layer security. We analyze two cross-group cooperative strategies with decode- and-forward relaying and compress-and-forward relaying respectively. We can use the decode-and-forward scheme only if the users which have both good communication channels from the source and high levels of security clearance are selected to serve as relays; otherwise, we cannot achieve physical layer security. While the compress-and-forward scheme is used, physical layer security can be achieved even though the relays have lower security clearance than the destinations.

Conference on Information Sciences and Systems•Mar 1, 2013•0 citations
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.
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.
This paper studies secure communication over the broadcast channels with an untrusted relay. The relay helps users with transmission in broadcast channels, but we also wish to keep the information secret against the relay. Compress-and-forward relaying is a potential strategy to achieve secrecy. We obtain the achievable rate-equivocation regions by combining it with Marton's coding scheme and Cover's superposition coding scheme respectively. The secrecy rate region based on Marton's coding scheme provides a general result, without knowing information regarding two users. If we know which user is better (i.e. receiving more information), we can design a simpler scheme with superposition encoding. Outer bound to the rate-equivocation regions is also provided in this paper.
We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable secrecy rate region of the broadcast channels with confidential messages. More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized noise-forward and compress-forward strategies) and an outer bound on the capacity-equivocation region are provided. Removing the secrecy constraint, this outer bound can also be served as a new outer bound for the relay broadcast channel. Second, we investigate the discrete memoryless relay broadcast channels with two confidential messages (no common message). Inner and outer bounds on the capacity-equivocation region are provided. Then, we study the Gaussian case, and find that with the help of the relay node, the achievable secrecy rate region of the Gaussian broadcast channels with two confidential messages is enhanced. Finally, we investigate the discrete memoryless relay broadcast channels with one confidential message and one common message. This work generalizes Lai-Gamals work on the relay-eavesdropper channel by considering an additional common message for both the legitimate receiver and the eavesdropper. Inner and outer bounds on the capacity-equivocation region are provided, and the results are further explained via a Gaussian example. Compared with Csiszár-Körner’s work on broadcast channels with confidential messages (BCC), we find that with the help of the relay node, the secrecy capacity region of the Gaussian BCC is enhanced.
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.
This paper studies the transmission rates and physical layer security of cooperative relay networks. For any relay network, there are natural information theoretic cut-set bounds, which upper bound the transmission rates. We further tighten the outer bounds on rate regions. We also study the achievable rate regions in consideration of physical layer security. We analyze two cross-group cooperative strategies with decode- and-forward relaying and compress-and-forward relaying respectively. We can use the decode-and-forward scheme only if the users which have both good communication channels from the source and high levels of security clearance are selected to serve as relays; otherwise, we cannot achieve physical layer security. While the compress-and-forward scheme is used, physical layer security can be achieved even though the relays have lower security clearance than the destinations.