Square root law for communication with low probability of detection on AWGN channels

We present a square root limit on low probability of detection (LPD) communication over additive white Gaussian noise (AWGN) channels. Specifically, if a warden has an AWGN channel to the transmitter with non-zero noise power, we prove that o(√n) bits can be sent from the transmitter to the receiver in n AWGN channel uses with probability of detection by the warden less than e for any ϵ >; 0, and, if a lower bound on the noise power on the warden's channel is known, then O(√n) bits can be covertly sent in n channel uses. Conversely, trying to transmit more than O(√n) bits either results in detection by the warden with probability one or a non-zero probability of decoding error as n → ∞. Further, we show that LPD communication on the AWGN channel allows one to send a nonzero symbol on every channel use, in contrast to what might be expected from the square root law found recently in image-based steganography.

[1]  E. Majani,et al.  A model for the study of very noisy channels, and applications , 1988 .

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

[3]  Jessica J. Fridrich,et al.  Fisher Information Determines Capacity of ε-Secure Steganography , 2009, Information Hiding.

[4]  W. Marsden.  I and J , 2012 .

[5]  Andrew D. Ker.  A Capacity Result for Batch Steganography , 2007, IEEE Signal Processing Letters.

[6]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[7]  G. Forney,et al.  Random codes: minimum distances and error exponents , 2002, Proceedings IEEE International Symposium on Information Theory,.

[8]  Evgueni A. Haroutunian,et al.  Information Theory and Statistics , 2011, International Encyclopedia of Statistical Science.

[9]  H. V. Trees,et al.  Part I. Detection, Estimation, and Linear Modulation Theory , 2013 .

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

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

[12]  Andrew D. Ker.  The square root law requires a linear key , 2009, MM&Sec '09.

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

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

[15]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

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

[17]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[18]  Lang Tong,et al.  The Embedding Capacity of Information Flows Under Renewal Traffic , 2011, IEEE Transactions on Information Theory.

[19]  Jessica J. Fridrich,et al.  The square root law of steganographic capacity for Markov covers , 2009, Electronic Imaging.

[20]  Marco Chiani,et al.  New exponential bounds and approximations for the computation of error probability in fading channels , 2003, IEEE Trans. Wirel. Commun..

[21]  N. D. Memon,et al.  Steganography capacity: a steganalysis perspective , 2003, IS&T/SPIE Electronic Imaging.

[22]  Hüseyin Arslan,et al.  A survey of spectrum sensing algorithms for cognitive radio applications , 2009, IEEE Communications Surveys & Tutorials.

[23]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

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

[25]  Van Trees,et al.  Detection, Estimation, and Modulation Theory. Part 1 - Detection, Estimation, and Linear Modulation Theory. , 1968 .

[26]  Alexander Barg,et al.  Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.

[27]  Donald F. Towsley,et al.  Square root law for communication with low probability of detection on AWGN channels , 2012, ISIT.

[28]  Stephen E. Fienberg,et al.  Testing Statistical Hypotheses , 2005 .

[29]  Andrew D. Ker.  Estimating Steganographic Fisher Information in Real Images , 2009, Information Hiding.

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

[31]  George Danezis,et al.  A Survey of Anonymous Communication Channels , 2008 .

[32]  Upamanyu Madhow.  Fundamentals of Digital Communication: References , 2008 .

[33]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[34]  Andrew D. Ker.  The square root law does not require a linear key , 2010, MM&Sec '10.

[35]  M. Melamed.  Detection , 2021, SETI: Astronomy as a Contact Sport.

[36]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.