Secure Multiplex Coding with a Common Message

Free registration required

Executive Summary

The authors determine the capacity region of the secure multiplex coding with a common message, and evaluate the mutual information and the equivocation rate of a collection of secret messages to the second receiver (eavesdropper), which were not evaluated by Yamamoto et al. The information theoretic security attracts much attention recently, because it offers security that does not depend on a conjectured difficulty of some computational problem. One of most fundamental problems in the information theoretic security is coding for the wiretap channel considered by Wyner. Later it was generalized to the broadcast channel with confidential messages (hereafter abbreviated as BCC) by Csisz?r and K?rner, in which there is a single sender called Alice and two receivers called Bob and Eve.

  • Format: PDF
  • Size: 96.48 KB