Hierarchical Polar Coding for Achieving Secrecy Over State-Dependent Wiretap Channels Without Any Instantaneous CSI

This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on the polarization of different binary symmetric channels over different fading blocks, each channel use is modeled as an appropriate binary erasure channel over fading blocks. Polar codes are constructed for both coding over channel uses for each fading block and coding over fading blocks for certain channel uses. In order to guarantee security, random bits are introduced at appropriate places to exhaust the observations of the eavesdropper. It is shown that this coding scheme, without instantaneous CSI at the transmitter, is secrecy capacity achieving for the simultaneous fading scenario. For the independent fading case, the capacity is achieved when the fading realizations for the eavesdropper channel are always degraded with respect to the receiver. For the remaining cases, the gap between lower and upper bounds is analyzed. Remarkably, for the scenarios where the secrecy capacity is achieved, the results imply that the instantaneous CSI does not increase the secrecy capacity.

[1]  Onur Ozan Koyluoglu,et al.  Polar coding for secure transmission and key agreement , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[2]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[3]  Joseph M. Renes,et al.  Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization , 2013, ASIACRYPT.

[4]  Alexander Vardy,et al.  A new polar coding scheme for strong security on wiretap channels , 2013, 2013 IEEE International Symposium on Information Theory.

[5]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[6]  Sriram Vishwanath,et al.  Polar Coding for Fading Channels: Binary and Exponential Channel Cases , 2013, IEEE Transactions on Communications.

[7]  Sriram Vishwanath,et al.  Expansion coding: Achieving the capacity of an AEN channel , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[8]  Remi A. Chou,et al.  Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy , 2016, IEEE Transactions on Information Theory.

[9]  Alexander Vardy,et al.  Achieving the secrecy capacity of wiretap channels using Polar codes , 2010, ISIT.

[10]  Alexander Barg,et al.  Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component , 2015, ITW.

[11]  Hesham El Gamal,et al.  On the Secrecy Capacity of Fading Channels , 2007, ISIT.

[12]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[13]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[14]  Sennur Ulukus,et al.  Polar coding for the general wiretap channel , 2014, 2015 IEEE Information Theory Workshop (ITW).

[15]  Meixia Tao,et al.  Polar Coding for Secure Transmission in MISO Fading Wiretap Channels , 2014, ArXiv.

[16]  Shlomo Shamai,et al.  Secrecy-achieving polar-coding , 2010, 2010 IEEE Information Theory Workshop.

[17]  Mikael Skoglund,et al.  Nested Polar Codes for Wiretap and Relay Channels , 2010, IEEE Communications Letters.

[18]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).