3-Receiver Broadcast Channels with Common and Confidential Messages

Details 3-Receiver Broadcast Channels with Common and Confidential Messages 3-Receiver Broadcast Channels with Common and Confidential Messages

2009-10-08

arxiv.org/abs/0910.1407v4

Computer Science

Information Theory

Revised version

Scientific paper

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be sent to two receivers and kept secret from the third receiver. Achievability is established using indirect decoding, Wyner wiretap channel coding, and the new idea of generating secrecy from a publicly available superposition codebook. The inner bound is shown to be tight for a class of reversely degraded broadcast channels and when both legitimate receivers are less noisy than the third receiver. The second setup investigated in this paper is when the confidential message is to be sent to one receiver and kept secret from the other two receivers. Achievability in this case follows from Wyner wiretap channel coding and indirect decoding. This inner bound is also shown to be tight for several special cases.

Affiliated with

Also associated with

No associations

Rating

3-Receiver Broadcast Channels with Common and Confidential Messages 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 3-Receiver Broadcast Channels with Common and Confidential Messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 3-Receiver Broadcast Channels with Common and Confidential Messages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352331