Covert bits through queues

2016 IEEE Conference on Communications and Network Security, CNS 2016

Volumn , Issue , 2017, Pages 626-630

  Mukherjee, Pritam ^a   Ulukus, Sennur ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUEUEING THEORY;

CHANNEL MODEL; COVERT COMMUNICATIONS; DEPARTURE TIME; DISCRETE MEMORYLESS CHANNELS; GAUSSIAN CHANNELS; INTER-ARRIVAL TIME; SECRET KEY; TIMING CHANNELS;

NETWORK SECURITY;

EID: 85016059577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CNS.2016.7860561     Document Type: Conference Paper

References (22)

1. V. Anantharam and S. Verdu. Bits through queues. IEEE Trans. on Inf. Theory, 42(1):4-18, Jan. 1996.
2. T. S. Han and S. Verdu. Approximation theory of output statistics. IEEE Trans. on Inf. Theory, 39(3):752-772, May 1993.
3. B. A. Bash, D. Goeckel, and D. Towsley. Limits of reliable communication with low probability of detection on AWGN channels. IEEE JSAC, 31(9):1921-1930, Sep. 2013.
4. M. R. Bloch. Covert communication over noisy channels: A resolvability perspective. IEEE Trans. on Inf. Theory, 62(5):2334-2354, May 2016.
5. L. Wang, G. Wornell, and L. Zheng. Fundamental limits of communication with low probability of detection. IEEE Trans. on Inf. Theory. To appear. Also available at [arXiv:1506.03236].
6. J. Hou and G. Kramer. Effective secrecy: Reliability, confusion and stealth. In IEEE ISIT, Jun. 2014.
7. I. S. Moskowitz and A. R. Miller. The channel capacity of a certain noisy timing channel. IEEE Trans. on Inf. Theory, 38(4):1339-1344, Jul. 1992.
8. I. S. Moskowitz, S. J. Greenwald, and M. H. Kang. An analysis of the timed z-channel. In IEEE S & P, May 1996.
9. T. S. Han. Information-Spectrum Methods in Information Theory. Springer-Verlag Berlin Heidelberg, 2003.
10. A. S. Bedekar and M. Azizoglu. The information-theoretic capacity of discrete-time queues. IEEE Trans. on Inf. Theory, 44(2):446-461, Mar. 1998.
11. B. P. Dunn, M. Bloch, and J. N. Laneman. Secure bits through queues. In IEEE ITW, June 2009.
12. T. P. Coleman and N. Kiyavash. Practical codes for queueing channels: An algebraic, state-space, message-passing approach. In IEEE ITW, May 2008.
13. N. Kiyavash, T. P. Coleman, and M. R. D. Rodrigues. Novel shaping and complexity-reduction techniques for approaching capacity over queuing timing channels. In IEEE ICC, Jun. 2009.
14. R. Sundaresan and S. Verdu. Sequential decoding for the exponential server timing channel. IEEE Trans. on Inf. Theory, 46(2):705-709, Mar. 2000.
15. X. Gong, N. Kiyavash, and P. Venkitasubramaniam. Information theoretic analysis of side channel information leakage in FCFS schedulers. In IEEE ISIT, Jul. 2011.
16. X. Gong and N. Kiyavash. Quantifying the information leakage in timing side channels in deterministic work-conserving schedulers. IEEE/ACM Trans. on Netw. To appear. Also available at [arXiv:1403.1276].
17. S. Kadloor, N. Kiyavash, and P. Venkitasubramaniam. Mitigating timing based information leakage in shared schedulers. In IEEE INFOCOM, Mar. 2012.
18. S. Kadloor, X. Gong, N. Kiyavash, and P. Venkitasubramaniam. Designing router scheduling policies: A privacy perspective. IEEE Trans. on Signal Process., 60(4):2001-2012, Apr. 2012.
19. S. Kadloor, P. Venkitasubramaniam, and N. Kiyavash. Preventing timing analysis in networks: A statistical inference perspective. IEEE Signal Process. Mag., 30(5):76-85, Sep. 2013.
20. J. Giles and B. Hajek. An information-theoretic and game-theoretic study of timing channels. IEEE Trans. on Inf. Theory, 48(9):2455-2477, Sep. 2002.
21. A. Askarov, D. Zhang, and A. C. Myers. Predictive black-box mitigation of timing channels. In ACM CCS, Oct. 2010.
22. A. Chen, W. B. Moore, H. Xiao, A. Haeberlen, L. T. X. Phan, M. Sherr, and W. Zhou. Detecting covert timing channels with time-deterministic replay. In USENIX OSDI, Oct. 2014.