Efficient minimum-cost network hardening via exploit dependency graphs

By Steven Noel, Sushil Jajodia, Brian O'Berry, Michael Jacobs. 19th Annual Computer Security Applications Conference, 2003. Proceedings., 2003

298 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.

An Attack Graph-Based Probabilistic Security Metric (2008, background): “Our work on minimum-cost network hardening is one of the first efforts toward the quantitative study of network security [15,29].”
A scalable approach to attack graph generation (2006, methodology): “A clear logical semantics for attack graphs also makes it easier to conduct further analysis based on the graph data structure.”
Dynamic Security Risk Management Using Bayesian Attack Graphs (2012, methodology): “use exploit dependency graphs to compute minimum-cost hardening measures [12].”
MulVAL: A Logic-based Network Security Analyzer (2005, background): “There is a long line of work on network vulnerability analysis [27, 25, 23, 24, 1, 17].”
DAG-based attack and defense modeling: Don't miss the forest for the attack trees (2013, background): “The work presented in [209] and [307] focuses on minimal cost of removing vulnerabilities in hardening a network.”