Secure polar coding with delayed wiretapping information

被引:1
作者
Zhao, Yizhi [1 ]
Chi, Hongmei [2 ]
机构
[1] Huazhong Agr Univ, Coll Informat, Wuhan, Hubei, Peoples R China
[2] Huazhong Agr Univ, Coll Sci, Wuhan, Hubei, Peoples R China
关键词
wireless channels; MIMO communication; cryptography; channel capacity; telecommunication channels; telecommunication security; channel coding; perfect CSI case; delay CSI assumption; modified multiblock chaining structure; explicit strong security polar coding scheme; secrecy capacity; secure schemes; secure polar coding; delayed wiretapping information; secure coding issue; wiretap channel model; fixed main channel; varying wiretap channel; wiretapping channel state information; symmetric degraded delay CSI case; explicit weak security scheme; secure polar codes; one-time pad chaining structure; CHANNELS; CAPACITY;
D O I
10.1049/iet-com.2019.1264
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this study, the authors investigate the secure coding issue for a wiretap channel model with fixed main channel and varying wiretap channel, by assuming that legitimate parties can obtain the wiretapping channel state information (CSI) with some delay. For the symmetric degraded delay CSI case, they present an explicit weak security scheme by constructing secure polar codes on a one-time pad chaining structure, and prove its weak security, reliability and capability of approaching the secrecy capacity for perfect CSI case with delay CSI assumption. Further for the symmetric no-degraded delay CSI case, they present a modified multi-block chaining structure in which the original subset of frozen bit is designed for conveying functional random bits securely. Then they combine this modified multi-block chaining structure with the weak security scheme to construct an explicit strong security polar coding scheme, and prove its strong security, reliability and also the capability of approaching the secrecy capacity for perfect CSI case with delay CSI assumption. At last, they carry out simulations to prove the performance of both secure schemes.
引用
收藏
页码:2564 / 2575
页数:12
相关论文
共 30 条
[1]  
Alsan M, 2014, IEEE INT SYMP INFO, P301, DOI 10.1109/ISIT.2014.6874843
[2]   Source Polarization [J].
Arikan, Erdal .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :899-903
[3]   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
[4]   Secrecy results for compound wiretap channels [J].
Bjelakovic, I. ;
Boche, H. ;
Sommerfeld, J. .
PROBLEMS OF INFORMATION TRANSMISSION, 2013, 49 (01) :73-98
[5]  
Bjelakovic Igor, 2013, Information Theory, Combinatorics, and Search Theory. In Memory of Rudolf Ahlswede, P123, DOI 10.1007/978-3-642-36899-8_5
[6]  
Chou RA, 2018, IEEE INT SYMP INFO, P476, DOI 10.1109/ISIT.2018.8437777
[7]   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
[8]  
Chou RA, 2015, ANN ALLERTON CONF, P1380, DOI 10.1109/ALLERTON.2015.7447169
[9]   Polar Coding for Secret-Key Generation [J].
Chou, Remi A. ;
Bloch, Matthieu R. ;
Abbe, Emmanuel .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) :6213-6237
[10]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892