By Topic

Covert timing channels codes for communication over interactive traffic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kiyavash, N. ; Dept. of Comput. Sci., Univ. of Illinois, Urbana, IL ; Coleman, T.

This paper presents the first practical perfectly-secure steganography codes for covert communication via packet timings across interactive traffic relayed over network queuing systems. It has recently been shown that sparse-graph linear codes followed by shaping techniques, combined with message-passing decoding, can enable practical timing channel codes with low symbol error rates near the information capacity of the famous ldquobits through queuesrdquo channel. Inspired by this new class of codes, we use an alternative shaping technique that employs random dithers and construct provably secure steganographic codes for communication using packet timings in interactive traffic. To validate the perfect secrecy of our steganographic codes, we model interactive traffic as a two-state Markov modulated Poisson process (MMPP) and show its goodness-of-fit.

Published in:

Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on

Date of Conference:

19-24 April 2009