How to Broadcast Privacy: Secret Coding for Deterministic Broadcast Channels
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.
KeywordsCapacity Region Secret Message Broadcast Channel Secrecy Capacity Output Alphabet
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- T. M. Cover, “Broadcast channels”, IEEE Trans. on Inform. Theory, vol. IT-18, 1972, 2–14.Google Scholar
- A. Yao, “Some complexity questions related to distributive computing”, Proc. 11th ACM Symp. Theory Comput., 1979, 209–213.Google Scholar