Hiding information in noise: fundamental limits of covert wireless communication

Widely deployed encryption-based security prevents unauthorized decoding, but does not ensure undetectability of communication. However, covert, or low probability of detection/intercept communication is crucial in many scenarios ranging from covert military operations and the organization of social unrest, to privacy protection for users of wireless networks. In addition, encrypted data or even just the transmission of a signal can arouse suspicion, and even the most theoretically robust encryption can often be defeated by a determined adversary using non-computational methods such as side-channel analysis. Various covert communication techniques have been developed to address these concerns, including steganography for finite-alphabet noiseless applications and spread-spectrum systems for wireless communications. After reviewing these covert communication systems, this article discusses new results on the fundamental limits of their capabilities, and provides a vision for the future of such systems as well.

[1]  Alfred O. Hero,et al.  Secure space-time communication , 2003, IEEE Trans. Inf. Theory.

[2]  Gerhard Kramer,et al.  Effective secrecy: Reliability, confusion and stealth , 2013, 2014 IEEE International Symposium on Information Theory.

[3]  Donald F. Towsley,et al.  Covert single-hop communication in a wireless network with distributed artificial noise generation , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Robert J. Baxley,et al.  Achieving positive rate with undetectable communication over AWGN and Rayleigh channels , 2014, 2014 IEEE International Conference on Communications (ICC).

[5]  Christine Nadel,et al.  Spread Spectrum Communications Handbook , 2016 .

[6]  Donald F. Towsley,et al.  Secret communication in large wireless networks without eavesdropper location information , 2012, 2012 Proceedings IEEE INFOCOM.

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

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

[9]  Matthieu R. Bloch,et al.  Strong Secrecy From Channel Resolvability , 2011, IEEE Transactions on Information Theory.

[10]  Jessica Fridrich,et al.  Steganography in Digital Media: References , 2009 .

[11]  Mary Ann Weitnauer,et al.  Achieving Undetectable Communication , 2015, IEEE Journal of Selected Topics in Signal Processing.

[12]  Donald F. Towsley,et al.  LPD communication when the warden does not know when , 2014, 2014 IEEE International Symposium on Information Theory.

[13]  Jun Yu,et al.  Subset selection circumvents the square root law , 2010, Electronic Imaging.

[14]  Mayank Bakshi,et al.  Reliable deniable communication: Hiding messages in noise , 2013, 2013 IEEE International Symposium on Information Theory.

[15]  Dirk Grunwald,et al.  Secret Agent Radio: Covert Communication through Dirty Constellations , 2012, Information Hiding.

[16]  Hesham El Gamal,et al.  The Relay–Eavesdropper Channel: Cooperation for Secrecy , 2006, IEEE Transactions on Information Theory.

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