Reliable deniable communication: Hiding messages in noise

Alice may wish to reliably send a message to Bob over a binary symmetric channel (BSC) while ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie observes a “significantly noisier” transmission than Bob does, he should be unable to estimate even whether Alice is transmitting or not. Even when Alice's (potential) communication scheme is publicly known to Willie (with no common randomness between Alice and Bob), we prove that over n channel uses Alice can transmit a message of length O(√n) bits to Bob, deniably from Willie. We also prove information-theoretically order-optimality of our results.

[1]  Imre Csiszár,et al.  Arbitrarily varying channels with constrained inputs and states , 1988, IEEE Trans. Inf. Theory.

[2]  Imre Csiszár,et al.  The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.

[3]  Ying Wang,et al.  Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions , 2007, IEEE Transactions on Information Theory.

[4]  Daniil Ryabko,et al.  Asymptotically optimal perfect steganographic systems , 2009, Probl. Inf. Transm..

[5]  Tomás Pevný,et al.  The square root law of steganographic capacity , 2008, MM&Sec '08.

[6]  Daniel Berend,et al.  A Reverse Pinsker Inequality , 2012, ArXiv.

[7]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[8]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[9]  Alon Orlitsky,et al.  Coding for computing , 2001, IEEE Trans. Inf. Theory.

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

[11]  David Kahn,et al.  The History of Steganography , 1996, Information Hiding.

[12]  Ross J. Anderson.  Stretching the Limits of Steganography , 1996, Information Hiding.

[13]  Gustavus J. Simmons,et al.  The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.

[14]  Ross J. Anderson,et al.  On the limits of steganography , 1998, IEEE J. Sel. Areas Commun..

[15]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[16]  E. Lehmann.  Testing Statistical Hypotheses , 1960 .

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

[18]  Sergio Verdú,et al.  Channels With Cost Constraints: Strong Converse and Dispersion , 2014, IEEE Transactions on Information Theory.

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

[20]  Andrew D. Ker.  The Square Root Law in Stegosystems with Imperfect Information , 2010, Information Hiding.

[21]  U. Maurer.  A Uniied and Generalized Treatment of Authentication Theory , 1996 .

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

[23]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[24]  Arthur Conan Doyle,et al.  The Sign of Four , 1890 .

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

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

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

[28]  Andrew D. Ker.  Improved Detection of LSB Steganography in Grayscale Images , 2004, Information Hiding.

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

[30]  Mayank Bakshi,et al.  Reliable, deniable, and hidable communication over multipath networks , 2014, 2014 IEEE International Symposium on Information Theory.

[31]  Daniel Berend,et al.  Minimum KL-Divergence on Complements of $L_{1}$ Balls , 2012, IEEE Transactions on Information Theory.

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

[33]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[34]  Ingemar J. Cox,et al.  Digital Watermarking and Steganography , 2014 .

[35]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .