Broadcast Channels with Confidential Messages by Randomness Constrained Stochastic Encoder

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 2 figures

Scientific paper

In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be leaked to an eavesdropper. In this paper, it is investigated that the trade-off between the rate of the random number to realize the stochastic encoding and the rates of the common, private, and confidential messages. For the direct theorem, the superposition coding scheme for the wire-tap channel recently proposed by Chia and El Gamal is employed, and its strong security is proved. The matching converse theorem is also established. Our result clarifies that a combination of the ordinary stochastic encoding and the channel prefixing by the channel simulation is suboptimal.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-56576

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.