Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A scalable representation towards attack graph generation

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)
Bhattacharya, S. ; Indian Inst. of Technol., Kharagpur ; Malhotra, S. ; Ghsoh, S.K.

In todaypsilas large complex organizational network, security administration is a challenging task. The typical means by which an attacker breaks into a network is through a series of exploits, where each exploit in the series satisfies the pre-condition for subsequent exploits and makes a causal relationship among them. Such a series of exploit is called attack path and the set of all possible attack paths form an attack graph. However, the generated attack graphs by various previous approaches become too complicated to visually interpret and comprehend. Hence the proposed approach addresses the scalability issue of the attack graph generation through a generic attack path detection algorithm. This will reduce the generation of redundancy in attack graph, thus facilitating security management of an enterprise network.

Published in:

Information Technology, 2008. IT 2008. 1st International Conference on

Date of Conference:

18-21 May 2008