• DocumentCode
    3663206
  • Title

    Cooperative broadcast channels with a secret message

  • Author

    Ziv Goldfeld;Gerhard Kramer;Haim H. Permuter

  • Author_Institution
    Ben Gurion University of the Negev, Israel
  • fYear
    2015
  • fDate
    6/1/2015 12:00:00 AM
  • Firstpage
    1342
  • Lastpage
    1346
  • 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.
  • Keywords
    "Decoding","Encoding","Receivers","Protocols","Random variables","Markov processes","Security"
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2015 IEEE International Symposium on
  • Electronic_ISBN
    2157-8117
  • Type

    conf

  • DOI
    10.1109/ISIT.2015.7282674
  • Filename
    7282674