Covert channel detection: A survey based analysis
Authors:
- 1 December 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19494092,p. 057-065
Abstract
Secret communication via network has always been an area of interest for many. It has not only attracted the trusted parties to communicate with each other secretly but has also attracted the hackers/attackers to find ways to discover and leak the information and use the network in a manner that violate security policies. Steganography and covert channels are most widely used approaches for secret communication. Number of detecting techniques has been proposed for steganography and covert channel detection. This paper covers detecting techniques of covert channel only as the covert channel is a modern way of leaking information and it is difficult to detect such channels. Covert channel falls into two categories: storage covert channel and timing covert channel. Storage covert channel is created by manipulating the header fields of packets whereas timing covert channel is created by timing of event i.e. arrival pattern of packets. In this paper different techniques for detecting storage and timing covert has been surveyed and analysis of these techniques is done.Keywords
This publication has 13 references indexed in Scilit:
- Detection of covert voice-over Internet protocol communications using sliding window-based steganalysisIET Communications, 2011
- Covert Channel Detection Based on Scale-Free Networks Theory2009
- On the secrecy of timing-based active watermarking trace-back techniques2006
- Covert channels and anonymizing networks2003
- Simple timing channels2002
- Single-packet IP tracebackIEEE/ACM Transactions on Networking, 2002
- An information-theoretic and game-theoretic study of timing channelsIEEE Transactions on Information Theory, 2002
- The channel capacity of a certain noisy timing channelIEEE Transactions on Information Theory, 1992
- Shared resource matrix methodologyACM Transactions on Computer Systems, 1983
- A note on the confinement problemCommunications of the ACM, 1973