Covert communications on Poisson packet channels

Consider a channel where authorized transmitter Jack sends packets to authorized receiver Steve according to a Poisson process with rate λ packets per second for a time period T. Suppose that covert transmitter Alice wishes to communicate information to covert receiver Bob on the same channel without being detected by a watchful adversary Willie. We consider two scenarios. In the first scenario, we assume that warden Willie cannot look at packet contents but rather can only observe packet timings, and Alice must send information by inserting her own packets into the channel. We show that the number of packets that Alice can covertly transmit to Bob is on the order of the square root of the number of packets that Jack transmits to Steve; conversely, if Alice transmits more than that, she will be detected by Willie with high probability. In the second scenario, we assume that Willie can look at packet contents but that Alice can communicate across an M/M/1 queue to Bob by altering the timings of the packets going from Jack to Steve. First, Alice builds a codebook, with each codeword consisting of a sequence of packet timings to be employed for conveying the information associated with that codeword. However, to successfully employ this codebook, Alice must always have a packet to send at the appropriate time. Hence, leveraging our result from the first scenario, we propose a construction where Alice covertly slows down the packet stream so as to buffer packets to use during a succeeding codeword transmission phase. Using this approach, Alice can covertly and reliably transmit O(λT) covert bits to Bob in time period T over an M/M/1 queue with service rate μ > e · λ.

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

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

[3]  Stefan Katzenbeisser,et al.  Hide and Seek in Time - Robust Covert Timing Channels , 2009, ESORICS.

[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]  Ira S. Moskowitz,et al.  Simple timing channels , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.

[6]  Gaurav Shah,et al.  Keyboards and Covert Channels , 2006, USENIX Security Symposium.

[7]  Saurabh Bagchi,et al.  TCP/IP Timing Channels: Theory to Implementation , 2009, IEEE INFOCOM 2009.

[8]  C. Gray Girling,et al.  Covert Channels in LAN's , 1987, IEEE Transactions on Software Engineering.

[9]  Donald F. Towsley,et al.  Covert Communications When the Warden Does Not Know the Background Noise Power , 2016, IEEE Communications Letters.

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

[11]  Vincent H. Berk,et al.  Detection of Covert Channel Encoding in Network Packet Delays , 2005 .

[12]  Steven Gianvecchio,et al.  Detecting covert timing channels: an entropy-based approach , 2007, CCS '07.

[13]  Sergio Verdú,et al.  Bits through queues , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[14]  Ira S. Moskowitz,et al.  The channel capacity of a certain noisy timing channel , 1992, IEEE Trans. Inf. Theory.

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

[16]  Todd P. Coleman,et al.  Novel Shaping and Complexity-Reduction Techniques for Approaching Capacity over Queuing Timing Channels , 2009, 2009 IEEE International Conference on Communications.

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

[18]  A. Gut.  Stopped Random Walks , 1987 .

[19]  Saurabh Bagchi,et al.  Capacity Bounds on Timing Channels with Bounded Service Times , 2007, 2007 IEEE International Symposium on Information Theory.

[20]  Sushil Jajodia,et al.  Model-Based Covert Timing Channels: Automated Modeling and Evasion , 2008, RAID.

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

[22]  Jonathan K. Millen.  Finite-state noiseless covert channels , 1989, Proceedings of the Computer Security Foundations Workshop II,.

[23]  Matthieu R. Bloch,et al.  Secure bits through queues , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

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

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

[26]  Todd P. Coleman,et al.  Covert timing channels codes for communication over interactive traffic , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[27]  Donald F. Towsley,et al.  Covert communication with the help of an uninformed jammer achieves positive rate , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[28]  Nikita Borisov,et al.  CoCo: Coding-Based Covert Timing Channels for Network Flows , 2011, Information Hiding.

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

[30]  Don H. Johnson,et al.  Calculation of the Kullback-Leibler distance between point process models , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

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

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

[33]  Matthieu R. Bloch,et al.  Physical Layer Security , 2020, Encyclopedia of Wireless Networks.

[34]  Dominic J. A. Welsh,et al.  Complexity and cryptography - an introduction , 2006 .

[35]  Anand S. Bedekar,et al.  The Information-Theoretic Capacity of Discrete-Time Queues , 1997, IEEE Trans. Inf. Theory.

[36]  Andrew D. Ker.  Batch Steganography and Pooled Steganalysis , 2006, Information Hiding.

[37]  Dipak Ghosal,et al.  A Covert Timing Channel Based on Fountain Codes , 2012, 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications.

[38]  Donald F. Towsley,et al.  Quantum-noise limited communication with low probability of detection , 2014, ArXiv.