@inproceedings{5ea37bc0e4ee42979906e6ac0bd4329b,
title = "Cooperative broadcast channels with a secret message",
abstract = "The broadcast channel (BC) with one confidential message and where the decoders cooperate via a one-sided link is considered. A pair of messages is transmitted, one message for each user. The message to the cooperative user is confidential and is kept secret from the cooperation-aided user. The secrecy level is measured by the equivocation rate. An inner bound on the secrecy-capacity region of the BC is derived. The inner bound is achieved by double-binning the codebook of the secret message. The inner bound is tight for the semi-deterministic (SD) and physically degraded (PD) cases. The secrecy results are compared to those of the corresponding BCs without a secrecy constraint. A cooperative Blackwell channel example illustrates the impact of secrecy on the rate regions.",
author = "Ziv Goldfeld and Gerhard Kramer and Permuter, \{Haim H.\}",
note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",
year = "2015",
month = sep,
day = "28",
doi = "10.1109/ISIT.2015.7282674",
language = "American English",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "1342--1346",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
}