Randomized Convolutional Codes for the Wiretap Channel

We study application of convolutional codes to the randomized encoding scheme introduced by Wyner as a way of confusing the eavesdropper over a wiretap channel. We describe optimal and practical sub-optimal decoders for the main and the eavesdropper’s channels, and estimate the security gap, which is used as the main metric. The sub-optimal decoder works based on the trellis of the code generated by a convolutional code and its dual, where one encodes the data bits and the other encodes the random bits. By developing a code design metric, we describe how these two generators should be selected for optimal performance over a Gaussian wiretap channel. We also propose application of serially concatenated convolutional codes to this setup so as to reduce the resulting security gaps. Furthermore, we provide an analytical characterization of the system performance by extending existing lower and upper bounds for coded systems to the current randomized convolutional coding scenario. We illustrate our findings via extensive simulations and numerical examples, which show that the newly proposed coding scheme can outperform the other existing methods in the literature in terms of security gap.

[1]  Frédérique E. Oggier,et al.  Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis , 2016, IEEE Trans. Inf. Theory.

[2]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Laboratories Technical Journal.

[3]  Marco Baldi,et al.  Coding With Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap Analysis , 2012, IEEE Transactions on Information Forensics and Security.

[4]  D. Divsalar,et al.  Multiple turbo codes for deep-space communications , 1995 .

[5]  Tolga M. Duman,et al.  Lower bounds on the error probability of turbo codes , 2014, 2014 IEEE International Symposium on Information Theory.

[6]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[7]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[8]  Rolf Johannesson,et al.  Fundamentals of Convolutional Coding , 1999 .

[9]  Il-Min Kim,et al.  BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification , 2014, IEEE Transactions on Communications.

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

[11]  Byung-Jae Kwak,et al.  LDPC Codes for the Gaussian Wiretap Channel , 2009, IEEE Transactions on Information Forensics and Security.

[12]  F. Pollara,et al.  Serial concatenation of interleaved codes: performance analysis, design and iterative decoding , 1996, Proceedings of IEEE International Symposium on Information Theory.

[13]  A. Robert Calderbank,et al.  Applications of LDPC Codes to the Wiretap Channel , 2004, IEEE Transactions on Information Theory.

[14]  Gérald E. Séguin A Lower Bound on the Error Probability for Signals in White Gaussian Noise , 1998, IEEE Trans. Inf. Theory.

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

[16]  Wei Zhong,et al.  Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix , 2003, IEEE Communications Letters.

[17]  Marco Baldi,et al.  Non-systematic codes for physical layer security , 2010, 2010 IEEE Information Theory Workshop.

[18]  Shlomo Shamai,et al.  Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial , 2006, Found. Trends Commun. Inf. Theory.

[19]  Marco Baldi,et al.  On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes , 2011, IEEE Transactions on Information Theory.

[20]  T. Duman,et al.  New performance bounds for turbo codes , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[21]  Alireza Nooraiepour,et al.  Randomized convolutional and concatenated codes for the wiretap channel , 2016 .

[22]  Neri Merhav,et al.  Lower bounds on the error probability of block codes based on improvements on de Caen's inequality , 2004, IEEE Transactions on Information Theory.