An indexing method for efficient querying of an attack graph

Abstract

Attack graphs are a novel way of examining how safe a network is from attacks and analysing the shortcomings of these networks. The analysis of the attack graph may help in assessing network security. However, an attack graph can be very large in size - containing a million nodes and a million edges. Thus analysing such a large graph becomes problematic and time consuming. We have proposed an indexing scheme for fast data retrieval. Using this indexing scheme we can identify the vulnerable machines in a network corresponding to an attack pattern.