By Topic

Two Scalable Approaches to Analyzing Network Security Using Compact Attack Graphs

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
$33 $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

4 Author(s)
Feng Chen ; Sch. of Comput., NUDT, Changsha, China ; Ri Tu ; Yi Zhang ; Jinshu Su

The compact attack graphs can implicitly reveal the potential threat of sophisticated multi-step attacks by enumerating possible sequences of exploits leading to the compromising given critical resources in enterprise networks with thousands of hosts. For security analysts, the challenge is how to analyze the complex attack graphs with possible ten thousands of nodes for defending the security of network. In the paper, we will essentially discuss two issues about it. The first is to compute non-loop attack paths with the distance less than the given number that the real attacker may take in realistic attack scenarios. The second is how to measure security risk. Two scalable approaches are proposed to solve the above two issues respectively. These approaches are proved to have a polynomial time complexity and can scale to the attack graphs with ten thousands of nodes corresponding to large enterprise networks.

Published in:

Information Engineering and Electronic Commerce, 2009. IEEC '09. International Symposium on

Date of Conference:

16-17 May 2009