Information flow graph: An approach to identifying covert storage channels

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper introduces a technique for detecting covert storage channels using a graph structure called an Information Flow Graph (IFG). The IFG can offer the information flows of the system for covert channel detection. By searching for the paths of an IFG, operation sequences can be gained, which will enhances the analyst's understanding of the channels. To illustrate the technique, an example system is analyzed and the result is compared to two analysis approaches, the Shared Resources Matrix and the Covert Flow Trees. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Song, X., Ju, S., Wang, C., & Zhou, C. (2011). Information flow graph: An approach to identifying covert storage channels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6802 LNCS, pp. 87–97). https://doi.org/10.1007/978-3-642-25283-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free