An Outer Bound to the Secrecy Capacity Region of CMAC with Confidential Messages and Non-Causal CSI

被引:0
|
作者
Li, Fangbiao [1 ]
Xue, Zhi [1 ]
Guo, Pengze [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200240, Peoples R China
关键词
SIDE INFORMATION; CHANNEL; TRANSMITTER; CAUSAL;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we investigate the problem of secret communication over a Compound Multiple Access Channel (CMAC) with confidential messages and non-causal Channel State Information (CSI) at both the transmitter and the receivers. In this channel, one common message M-0 is sent to both of the receivers, the private messages M-1 and M-2 are sent to the corresponding receiver, while M-1 is only decoded by the first receiver and is kept confidential from the second receiver. We provide a theorem to give the outer bound to the secrecy capacity region of this channel model. The outer bound to the secrecy capacity region of this paper subsumes Csiszar and Korner's region of the broadcast channel with confidential messages and the region of CMAC with confidential messages and no side information as its special case. The proof of the theorem is presented in details.
引用
收藏
页码:833 / 839
页数:7
相关论文
共 39 条
  • [1] An Outer Bound to the Rate Equivocation Region of Broadcast Channels with Two Confidential Messages
    Xu, Jin
    Chen, Biao
    GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
  • [2] Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages
    Liu, Ruoheng
    Poor, H. Vincent
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (03) : 1235 - 1249
  • [3] On Inner Bound for E-capacity Region of the Broadcast Channel With Confidential Messages
    Afshar, N.
    Haroutunian, E.
    Haroutunian, M.
    2012 20TH TELECOMMUNICATIONS FORUM (TELFOR), 2012, : 576 - 579
  • [4] An algorithm for computing the secrecy capacity of broadcast channels with confidential messages
    Yasui, Kensuke
    Suko, Tota
    Matsushima, Toshiyasu
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 936 - 940
  • [5] A New Outer Bound for the Gaussian Interference Channel with Confidential Messages
    He, Xiang
    Yener, Aylin
    2009 43RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2009, : 318 - 323
  • [6] RANDOM CODING BOUND FOR E-CAPACITY REGION OF THE BROADCAST CHANNEL WITH CONFIDENTIAL MESSAGES
    Afshar, Nasrin
    Haroutunian, Evgueni
    Haroutunian, Mariam
    COMMUNICATIONS IN INFORMATION AND SYSTEMS, 2012, 12 (02) : 131 - 156
  • [7] Random Coding Bound for E-capacity Region of the Relay Channel With Confidential Messages
    Afshar, Nasrin
    Akhbari, Bahareh
    Aref, Mohammad Reza
    2014 IRAN WORKSHOP ON COMMUNICATION AND INFORMATION THEORY (IWCIT), 2014,
  • [8] On the secrecy capacity region of 3-user cognitive multiple-access channels with confidential messages
    Sonee, Amir
    Hodtani, Ghosheh Abed
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2017, 28 (11):
  • [9] Random Coding Bound for E-capacity Region of the Broadcast Channel With Two Confidential Messages
    Afshar, Nasrin
    Haroutunian, Evgueni
    2012 20TH TELECOMMUNICATIONS FORUM (TELFOR), 2012, : 522 - 524
  • [10] Inner and outer bounding capacity region for multiple-access relay channel with non-causal side information at one encoder
    Etminan, Jalil
    Mohanna, Farahnaz
    Abed Hodtani, Ghosheh
    WIRELESS NETWORKS, 2022, 28 (01) : 85 - 106