Strong Secrecy on a Class of Degraded Broadcast Channels Using Polar Codes

被引:3
作者
del Olmo Alos, Jaume [1 ]
Rodriguez Fonollosa, Javier [1 ]
机构
[1] Univ Politecn Cataluna, Dept Teoria Senyal & Commun TSC, ES-08034 Barcelona, Spain
关键词
polar codes; information-theoretic security; degraded broadcast channels; strong secrecy; WIRETAP CHANNELS; NETWORKS; CAPACITY;
D O I
10.3390/e20060467
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Asymptotic secrecy-capacity achieving polar coding schemes are proposed for the memoryless degraded broadcast channel under different reliability and secrecy requirements: layered decoding or layered secrecy. In these settings, the transmitter wishes to send multiple messages to a set of legitimate receivers keeping them masked from a set of eavesdroppers. The layered decoding structure requires receivers with better channel quality to reliably decode more messages, while the layered secrecy structure requires eavesdroppers with worse channel quality to be kept ignorant of more messages. Practical constructions for the proposed polar coding schemes are discussed and their performance evaluated by means of simulations.
引用
收藏
页数:35
相关论文
共 31 条
[1]  
[Anonymous], 2011, INFORM THEORY CODING, DOI DOI 10.1017/CBO9780511921889
[2]  
[Anonymous], 2009, CAUSALITY, DOI DOI 10.1017/CBO9780511803161
[3]  
[Anonymous], 2012, ELEMENTS INFORM THEO
[4]  
[Anonymous], 2009, American Mathematical Soc.
[5]  
[Anonymous], 2011, Physical-layer security:from information theory to security engineering, DOI DOI 10.1017/CBO9780511977985
[6]   Source Polarization [J].
Arikan, Erdal .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :899-903
[7]   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
[8]  
Chou RA, 2016, IEEE INT SYMP INFO, P983, DOI 10.1109/ISIT.2016.7541446
[9]   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
[10]  
Chou RA, 2015, ANN ALLERTON CONF, P1380, DOI 10.1109/ALLERTON.2015.7447169