Polar Coding for Common Message Only Wiretap Broadcast Channel

被引：0
作者：
del Olmo Alos, Jaume [1 ]
Fonollosa, Javier R. [1 ]
机构：
[1] Univ Politecn Cataluna, Barcelona, Spain
来源：
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2019年
关键词：
SECRECY CAPACITY;
D O I：
10.1109/isit.2019.8849545
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send a private and a confidential message that must be reliably decoded by the receivers, and the confidential message must also be (strongly) secured from the eavesdropper. The coding scheme aims to use the optimal rate of randomness and does not make any assumption regarding the symmetry or degradedness of the channel. This paper extends previous work on polar codes for the wiretap channel by proposing a new chaining construction that allows to reliably and securely send the same confidential message to two different receivers. This construction introduces new dependencies between the random variables involved in the coding scheme that need to be considered in the secrecy analysis.
引用
收藏
页码：1762 / 1766
页数：5
相关论文
共 16 条
[1]   Source Polarization [J].
Arikan, Erdal .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :899-903
[2]   Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].
Arikan, Erdal .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073
[3]   Three-Receiver Broadcast Channels With Common and Confidential Messages [J].
Chia, Yeow-Khiang ;
El Gamal, Abbas .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (05) :2748-2765
[4]   Polar Coding for the Multiple Access Wiretap Channel via Rate-Splitting and Cooperative Jamming [J].
Chou, Remi A. ;
Yener, Aylin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (12) :7903-7921
[5]   Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy [J].
Chou, Remi A. ;
Bloch, Matthieu R. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (05) :2410-2429
[6]  
Chou RA, 2015, ANN ALLERTON CONF, P1380, DOI 10.1109/ALLERTON.2015.7447169
[7]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[8]   Strong Secrecy on a Class of Degraded Broadcast Channels Using Polar Codes [J].
del Olmo Alos, Jaume ;
Rodriguez Fonollosa, Javier .
ENTROPY, 2018, 20 (06)
[9]   Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component [J].
Gulcu, Talha Cihad ;
Barg, Alexander .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (02) :1311-1324
[10]  
Hassani SH, 2014, IEEE INT SYMP INFO, P1451, DOI 10.1109/ISIT.2014.6875073
12