A scalable approach to attack graph generation

By Xinming Ou, Wayne F. Boyer, Miles A. McQueen. Conference on Computer and Communications Security, 2006

710 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Optimal Network Security Hardening Using Attack Graph Games (2015, methodology): “We use the common monotonicity assumption [1, 24, 19] that once a fact becomes true during an attack, it can never become false again as an effect of any action.”
A Learning-Based Approach to Reactive Security (2009, methodology): “Datalog programs, which are based on Horn clauses, have been used in previous work to represent vulnerability-level attack graphs [19].”
NICE: Network Intrusion Detection and Countermeasure Selection in Virtual Network Systems (2013, background): “understand threats and then to decide appropriate countermeasures [22].”
DAG-based attack and defense modeling: Don't miss the forest for the attack trees (2013, methodology): “[216] optimized the generation and representation of attack graphs by transforming them into logical attack graphs of polynomial size with respect to the number of components of the computer network analyzed.”