Two formal analyses of attack graphs

By Somesh Jha, Oleg Sheyner, Jeannette M. Wing. Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15, 2002

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

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, methodology): “In an extension of the network vulnerability analysis of Ritchey and Ammann, Jha et al [8] and Sheyner et al [13] use model checking to analyze attack graphs on heterogeneous networks.”