Computationally efficient deniable communication

In this paper, we design the first computationally efficient codes for simultaneously reliable and deniable communication over a Binary Symmetric Channel (BSC). Our setting is as follows. A transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is deniable from an eavesdropper Willie (who hears Alice's transmission over a noisier BSC). Prior works show that Alice can reliably and deniably transmit O(√n) bits over n channel uses without any shared secrets between Alice and Bob. One drawback of prior works is that the computational complexity of the codes designed scales as 2Θ(√n). In this work we provide the first computationally tractable codes with provable guarantees on both reliability and deniability, while simultaneously achieving the best known throughput for the problem.

[1]  Lizhong Zheng,et al.  Limits of low-probability-of-detection communication over a discrete memoryless channel , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[3]  Matthieu R. Bloch,et al.  Wireless Information-Theoretic Security , 2008, IEEE Transactions on Information Theory.

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

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

[6]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..

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

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

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

[10]  Mayank Bakshi,et al.  Reliable, deniable and hidable communication , 2014, 2014 Information Theory and Applications Workshop (ITA).

[11]  Mayank Bakshi,et al.  Reliable deniable communication with channel uncertainty , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[12]  Luke Deshotels,et al.  Inaudible Sound as a Covert Channel in Mobile Devices , 2014, WOOT.

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

[14]  Guillermo Morales-Luna,et al.  On the Existence of Perfect Stegosystems , 2005, IWDW.

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

[16]  G. David Forney,et al.  Concatenated codes , 2009, Scholarpedia.

[17]  Carlisle M. Adams,et al.  On Characterizing and Measuring Out-of-Band Covert Channels , 2015, IH&MMSec.

[18]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

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

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

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

[22]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

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

[24]  Robert J. Baxley,et al.  Achieving positive rate with undetectable communication Over MIMO rayleigh channels , 2014, 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop (SAM).

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

[26]  Mayank Bakshi,et al.  Reliable, deniable and hidable communication: A quick survey , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

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

[28]  Donald F. Towsley,et al.  Quantum noise limited optical communication with low probability of detection , 2013, 2013 IEEE International Symposium on Information Theory.

[29]  B. Harshbarger.  An Introduction to Probability Theory and its Applications, Volume I , 1958 .

[30]  Matthias Hollick,et al.  Practical covert channels for WiFi systems , 2015, 2015 IEEE Conference on Communications and Network Security (CNS).

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

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

[33]  Saikat Guha,et al.  Quantum-secure covert communication on bosonic channels , 2015, Nature Communications.

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

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

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