Computer-attack graph generation tool

By Laura Painton Swiler, C. Phillips, D. Ellis, Stefan Chakerian. Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01, 2001

375 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/71c3dcf5fa5a6fe75e9f9dc68aeedd3101c116d7

How researchers see this paper

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

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

An Attack Graph-Based Probabilistic Security Metric (2008, background): “To generate attack graphs, topological vulnerability analysis enumerates potential multi-step intrusions based on prior knowledge about vulnerabilities and their relationships [5,7,16,21,26,33].”
Foundations of Attack Trees (2005, background): “Other research considers attack graphs [9,13], in which event sequences are the central topic of research, rather than event abstractions.”
DAG-based attack and defense modeling: Don't miss the forest for the attack trees (2013, methodology): “The term attack graph has been first introduced by Phillips and Swiler [205, 256] in 1998, and has extensively been used ever since.”
Dynamic Security Risk Management Using Bayesian Attack Graphs (2012, background): “A number of researchers have proposed risk assessment methods by building security models of network systems, using paradigms like attack graphs [1], [2], [3], [4], [5] and attack trees [6], [7], [8], [9], and then finding attack paths in these models to determine scenarios that could lead to damage”
Two formal analyses of attack graphs (2002, background): “For example, in the network security example given in Section 4, the property given below is used to express that the privilege level of the intruder on the host with index 2 should always be less than the root (administrative) privilege.”
Automated generation and analysis of attack graphs (2002, methodology): “refer to the advantages of the backward search in their paper [23].”
Efficient minimum-cost network hardening via exploit dependency graphs (2003, methodology): “Various methods have been proposed for finding attack paths (sequences of exploit state transitions) in such models, including symbolic model checker (logic-based) approaches [1][2][3][4], and graphbased approaches [5][6][7][8][9].”
How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols (2003, methodology): “, [12–16]), which employ model checking techniques to identify sequences of component attacks that may lead to the compromise of certain security properties.”
Scalable, graph-based network vulnerability analysis (2002, neutral): “The closest work to ours is that of Swiler et al [10], which has been implemented in [14].”