How to Broadcast Privacy: Secret Coding for Deterministic Broadcast Channels

  • Ning Cai
  • Kwok Yan Lam


We consider a broadcast channel, a channel with one sender and two receivers, and introduce a new model in which we require that each receiver not only can correctly (with a probability close to one) decode his/her own message but also obtains no (significant amount of) information about the message for the other receiver. We determine the capacity region for the deterministic broadcast channel in the presence of randomization at the sender’s side. In the case that randomization is not allowed, we reduce the coding problem to an open problem in Combinatorics.


Capacity Region Secret Message Broadcast Channel Secrecy Capacity Output Alphabet 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Ahlswede, “Coloring hypergraphs: A new approach to multi-user source coding”, J. Comb. Inform. Syst. Sci., Part I, vol.4, 1979, 76–115: Part II, vol. 5, 1980, pp. 220–268.MathSciNetMATHGoogle Scholar
  2. [2]
    R. Ahlswede and N. Cai, “On communication complexity of vector-valued functions”, IEEE Trans. on Inform. Theory, vol. IT-40, 1994, 2062–2067.Google Scholar
  3. [3]
    R. Ahlswede and I. Csiszâr, “Common randomness in information theory and cryptography”, Part I: Secret sharing, IEEE Trans on Inform. Theory, vol. IT-39, 1993, 1121–1132.Google Scholar
  4. [4]
    I. Csiszâr, “Almost independence and secrecy capacity”, Probl. Inform. Trans., vol. 32, 1996, 40–47.MATHGoogle Scholar
  5. [5]
    I. Csiszâr and J. Körner, “Broadcast channels with confidential messages”, IEEE Trans. on Inform. Theory, vol. IT-24, 1978, 339–348.Google Scholar
  6. [6]
    T. M. Cover, “Broadcast channels”, IEEE Trans. on Inform. Theory, vol. IT-18, 1972, 2–14.Google Scholar
  7. [7]
    M. S. Pinsker, “Capacity region of noiseless broadcast channels”, Prob. Inform. Trans., vol. 14, 1978, 28–32.MathSciNetMATHGoogle Scholar
  8. [8]
    A. D. Wyner, “The wire-tap Channels”, Bell System Tech. J., vol. 54, 1975, 1355–1387.MathSciNetMATHGoogle Scholar
  9. [9]
    A. Yao, “Some complexity questions related to distributive computing”, Proc. 11th ACM Symp. Theory Comput., 1979, 209–213.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Ning Cai
    • 1
  • Kwok Yan Lam
    • 1
  1. 1.School of ComputingNational University of SingaporeSingapore

Personalised recommendations