By Topic

Another Proof for the Secrecy Capacity of the K-Receiver Broadcast Channel 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
$31 $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

2 Author(s)
Li-Chia Choo ; Dept. of Electron. & Electr. Eng., Univ. Coll. London, London, UK ; Kai-Kit Wong

The secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyner's random code partitioning are used to show the achievable rate tuples. Error probability analysis and equivocation calculation are also provided. In the converse proof, a new definition for the auxiliary random variables is used, which is different from either the case of the two-receiver BC without common message or the K-receiver BC with common message, both with an external wiretapper, or the K -receiver BC without a wiretapper.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 4 )