%0 Conference Proceedings
%T Stealthier Inter-packet Timing Covert Channels
%+ Swinburne University of Technology [Melbourne]
%A Zander, Sebastian
%A Armitage, Grenville
%A Branch, Philip
%Z Part 9: Path Diversity
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th IFIP Networking Conference (NETWORKING)
%C Valencia, Spain
%Y Jordi Domingo-Pascual
%Y Pietro Manzoni
%Y Sergio Palazzo
%Y Ana Pont
%Y Caterina Scoglio
%I Springer
%3 NETWORKING 2011
%V LNCS-6640
%N Part I
%P 458-470
%8 2011-05-09
%D 2011
%R 10.1007/978-3-642-20757-0_36
%K Covert Channels
%K Steganography
%K Inter-packet Times
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Covert channels aim to hide the existence of communication. Recently proposed packet-timing channels encode covert data in inter-packet times, based on models of inter-packet times of normal traffic. These channels are detectable if normal inter-packet times are not independent identically-distributed, which we demonstrate is the case for several network applications. We show that ~80% of channels are detected with a false positive rate of 0.5%. We then propose an improved channel that is much harder to detect. Only ~9% of our new channels are detected at a false positive rate of 0.5%. Our new channel uses packet content for synchronisation and works with UDP and TCP traffic. The channel capacity reaches over hundred bits per second depending on overt traffic and network jitter.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01583422/document
%2 https://inria.hal.science/hal-01583422/file/978-3-642-20757-0_36_Chapter.pdf
%L hal-01583422
%U https://inria.hal.science/hal-01583422
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-NETWORKING
%~ IFIP-LNCS-6640