Secrecy in Cooperative Relay Broadcast Channels

Details Secrecy in Cooperative Relay Broadcast Channels Secrecy in Cooperative Relay Broadcast Channels

2008-11-09

arxiv.org/abs/0811.1317v1

Computer Science

Information Theory

Submitted to IEEE Trans. Inf. Theory, October 2008

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Secrecy in Cooperative Relay Broadcast Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secrecy in Cooperative Relay Broadcast Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secrecy in Cooperative Relay Broadcast Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484006