By Topic

On a special class of broadcast channels with confidential messages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. Van Dijk ; Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands

It is shown that Csiszar and Korner's (1978) characterization of a discrete memoryless channel (DMC)X→Y as being less noisy than the DMC X→Z is equivalent to the condition that the mutual-information difference I(X;Y)-I(X;Z) be a convex-∩ function of the probability distribution for X. This result is used to obtain a simple determination of the capacity region of the broadcast channel with confidential messages (BCC), which is a DMC X→(Y,Z), when the DMC X→Y to the legitimate receiver is less noisy than the DMC X→Z to the enemy cryptanalyst and there is a probability distribution for X having strictly positive components that achieves capacity on both these channels. In particular, when these DMC's are both symmetric, then the secrecy capacity of the BCC is the difference of their capacities. It is shown further that the less-noisy condition in this result cannot be weakened to the condition that the DMC X→Y be more capable than the DMC X→Z in the sense of Csiszar and Korner

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 2 )