By Topic

An indexing method for efficient querying of an attack graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ruia, A. ; Dept. of Comput. Sci. & Eng., Jadavpur Univ., Kolkata, India ; Parekh, V. ; Chakrabarti, A.

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.

Published in:

Recent Trends in Information Systems (ReTIS), 2011 International Conference on

Date of Conference:

21-23 Dec. 2011