Scalable, graph-based network vulnerability analysis
Abstract
Even well administered networks are vulnerable to attack. Recent work in network security has focused on the fact that combinations of exploits are the typical means by which an attacker breaks into a network. Researchers have proposed a variety of graph-based algorithms to generate attack trees (or graphs). Either structure represents all possible sequences of exploits, where any given exploit can take advantage of the penetration achieved by prior exploits in its chain, and the final exploit in the chain achieves the attacker's goal. The most recent approach in this line of work uses a modified version of the model checker NuSMV as a powerful inference engine for chaining together network exploits, compactly…
Citation impact
- FWCI
- 21.53
- Percentile
- 100%
- References
- 9
Authors
3- PAPaul AmmannCorresponding
George Mason University
- DWDuminda Wijesekera
George Mason University
- SKSaket Kaushik
George Mason University
Topics & keywords
- Exploit
- Computer science
- Scalability
- Theoretical computer science
- Chaining
- Computer security