Efficient and Fast Detection of Covert Channels using Mutation Analysis

Covert channels are among the serious and most complicated security flaws that attempt to broke the access control policies, since they allow an unplanned communication medium within an information system. The important impact of this vulnerability gives it a wide interest by the researchers. In this paper, we propose a new approach based on an enhanced version of the shared resources matrix method, where the principle of mutation analysis is integrated to allow an efficient and fast detection of covert channels. We have conducted an evaluation within a real system and the obtained results show very promising performances.

[1]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[2]  Butler W. Lampson,et al.  A note on the confinement problem , 1973, CACM.

[3]  Richard A. Kemmerer,et al.  A practical approach to identifying storage and timing channels: twenty years later , 2002, 18th Annual Computer Security Applications Conference, 2002. Proceedings..

[4]  Richard J. Lipton,et al.  Hints on Test Data Selection: Help for the Practicing Programmer , 1978, Computer.

[5]  Sihan Qing,et al.  Optimization of covert channel identification , 2005, Third IEEE International Security in Storage Workshop (SISW'05).

[6]  Richard A. Kemmerer,et al.  Shared resource matrix methodology: an approach to identifying storage and timing channels , 1983, TOCS.