Strong Security and Separated Code Constructions for the Broadcast Channels With Confidential Messages
The authors show that the capacity region of the broadcast channel with confidential messages does not change when the strong security criterion is adopted instead of the weak security criterion traditionally used. They also show a construction method of coding for the broadcast channel with confidential messages by using an arbitrary given coding for the broadcast channel with degraded message sets. The information theoretic security attracts much attention recently, because it offers security that does not depend on a conjectured difficulty of some computational problem. A classical problem in the information theoretic security is the Broadcast Channel with Confidential messages (abbreviated as BCC) first considered by Csisz?r and K?rner, in which there is a single sender called Alice and two receivers called Bob and Eve.