The Secrecy Capacity of the Semi-deterministic Broadcast Channel

被引:4
作者
Kang, Wei [1 ]
Liu, Nan [1 ]
机构
[1] Southeast Univ, Sch Informat Sci & Engn, Nanjing 210096, Peoples R China
来源
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 | 2009年
关键词
MULTIPLE-ACCESS; CONFIDENTIAL MESSAGES;
D O I
10.1109/ISIT.2009.5205819
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we study secure communications over a two-user semi-deterministic broadcast channel, i.e., one of the receivers is connected to the transmitter through a deterministic channel. We consider the case where the deterministic receiver is also the eavesdropper for the other receiver's message. We derive the secrecy capacity region by showing that superposition encoding plus Gel'fand-Pinsker encoding is optimal. We find that due to the deterministic component of the channel, Gel'fand-Pinsker binning alone is enough to achieve perfect secrecy. We also compare our scheme with the capacity-achieving scheme of Marton for the semi-deterministic broadcast channel where there is no secrecy constraint.
引用
收藏
页码:2767 / 2771
页数:5
相关论文
共 32 条
[1]  
Ahlswede R, 2006, LECT NOTES COMPUT SC, V4123, P249
[2]  
[Anonymous], IEEE INT S INF THEOR
[3]  
[Anonymous], 41 ANN C INF SCI SYS
[4]  
[Anonymous], 1991, ELEMENTS INFORM THEO
[5]  
[Anonymous], 1981, Information Theory: Coding Theorems for Discrete Memoryless Systems
[6]  
BAGHERIKARAM G, SECRECY RATE REGION
[7]  
CHOO LC, IEEE T INFORM UNPUB
[8]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[9]  
EKREM E, 2008, EURASIP J UNPUB NOV
[10]  
Ekrem E., 2008, IEEE T INF UNPUB OCT