Multilevel-Coded Pulse-Position Modulation for Covert Communications Over Binary-Input Discrete Memoryless Channels

We consider the problem of coding to ensure covert communication, which involves ensuring reliable communication between two legitimate parties while simultaneously guaranteeing a low probability of detection by an eavesdropper. Specifically, we develop an optimal low-complexity coding scheme that achieves the information-theoretic limits of covert communications over binary-input discrete memoryless channels (BI-DMCs). To justify our design, we first consider a regime in which information theory proves the possibility of covert communication without shared secret key and show the impossibility of achieving information-theoretic limits using linear codes without secret key. We then circumvent this impossibility by introducing non-linearity into the coding scheme through the use of pulse position modulation (PPM) and multilevel coding (MLC). This MLC-PPM scheme exhibits several appealing properties; in particular, for an appropriate decoder, the channel at a given level is independent of the total number of levels and the codeword length. We exploit these properties to show how one can use families of channel capacity- and channel resolvability-achieving codes to concretely instantiate a covert communication scheme.

[1]  Andrew Thangaraj,et al.  Error-Control Coding for Physical-Layer Secrecy , 2015, Proceedings of the IEEE.

[2]  Matthieu R. Bloch,et al.  Covert Communication Over Noisy Channels: A Resolvability Perspective , 2015, IEEE Transactions on Information Theory.

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  Robert F. H. Fischer,et al.  Multilevel codes: Theoretical concepts and practical design rules , 1999, IEEE Trans. Inf. Theory.

[5]  David Matas,et al.  A non-linear channel code for covert communications , 2019, 2019 IEEE Wireless Communications and Networking Conference (WCNC).

[6]  Donald F. Towsley,et al.  Hiding information in noise: fundamental limits of covert wireless communication , 2015, IEEE Communications Magazine.

[7]  T. Moon Error Correction Coding: Mathematical Methods and Algorithms , 2005 .

[8]  Matthieu R. Bloch,et al.  First- and Second-Order Asymptotics in Covert Communication , 2017, IEEE Transactions on Information Theory.

[9]  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.

[10]  Lizhong Zheng,et al.  Fundamental Limits of Communication With Low Probability of Detection , 2015, IEEE Transactions on Information Theory.

[11]  Matthieu R. Bloch,et al.  Optimal covert communications using pulse-position modulation , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[12]  Mihir Bellare,et al.  Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity , 2012, IACR Cryptol. ePrint Arch..

[13]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[14]  Dariush Divsalar,et al.  EXIT Function Aided Design of Iteratively Decodable Codes for the Poisson PPM Channel , 2010, IEEE Transactions on Communications.

[15]  Georg Böcherer,et al.  Polar-Coded Pulse Position Modulation for the Poisson Channel , 2018, 2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC).

[16]  Matthieu R. Bloch,et al.  Multilevel-Coded Pulse-Position Modulation for Covert Communications Over Binary-Input Discrete Memoryless Channels , 2018, IEEE Transactions on Information Theory.

[17]  Jörg Kliewer,et al.  Empirical and Strong Coordination via Soft Covering With Polar Codes , 2016, IEEE Transactions on Information Theory.

[18]  Boulat A. Bash,et al.  Limits of Reliable Communication with Low Probability of Detection on AWGN Channels , 2012, IEEE Journal on Selected Areas in Communications.

[19]  Gianluigi Liva,et al.  Non-Binary LDPC Code Design for the Poisson PPM Channel , 2017, IEEE Transactions on Communications.

[20]  Donald F. Towsley,et al.  Square root law for communication with low probability of detection on AWGN channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[22]  Donald F. Towsley,et al.  Covert communication over classical-quantum channels , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[23]  Matthieu R. Bloch,et al.  Polar codes for covert communications over asynchronous Discrete Memoryless Channels , 2017, 2017 51st Annual Conference on Information Sciences and Systems (CISS).

[24]  Christian Cachin,et al.  An information-theoretic model for steganography , 1998, Inf. Comput..

[25]  Mayank Bakshi,et al.  Computationally efficient deniable communication , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[26]  Matthieu R. Bloch,et al.  Keyless covert communication over Multiple-Access Channels , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[27]  Donald F. Towsley,et al.  Covert Communication Gains From Adversary’s Ignorance of Transmission Time , 2014, IEEE Transactions on Wireless Communications.

[28]  Jörg Kliewer,et al.  Low-complexity channel resolvability codes for the symmetric multiple-access channel , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[29]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[30]  Ligong Wang Optimal throughput for covert communication over a classical-quantum channel , 2016, 2016 IEEE Information Theory Workshop (ITW).

[31]  Sergio Verdú,et al.  $f$ -Divergence Inequalities , 2015, IEEE Transactions on Information Theory.