Abstract
For solving scalability problem of Network Attack Graph(NAG), this paper presents a new method for network modeling based on layered NAG. Layered NAG includes “attack subgraph” and “attack supergraph”. The attack subgraph describes specific attack scenarios from the source host to the destination host and efficiently produces the attack planning after eliminating redundant paths and nodes. The attack supergraph describes the attacker’s privilege transition to allow the network administrator to evaluate the vulnerabilities of the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Ammann, J. Pamula, and R.Ritchey, “A Host– Based Approach to Network Attack Chaining Analysis”, Proceedings of the 21st Annual Computer Security Applications Conference 2005.
R. Ritchey, B. O’Berry, and S. Noel, “Representing TCP/IP Connectivity for Topological Analysis of Network Security”, Proceedings of the 18th Annual Computer Security Applications Conference, 2002, pp. 25-31.
O. Sheyner, “Scenario graphs and attack graphs”, PhD Thesis, School of Computer Science Carnegie Mellon University, 2004.
L. Swiler, C. Phillips, D. Ellis, and S. Chakerian, “Computer-attack graph generation tool”, Proceedings of DARPA Information Survivability Conference & Exposition II, June 2001, pp. 307-321.
P. Ammann, D. Wijesekera, and S. Kaushik, “Scalable graph-based vulnerability analysis”, Proceedings of the 9th ACM Conference on Computer and Communications Security, 2002, pp. 217-224.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Wang, Y., Gui, N., Hu, J., Chen, Z. (2010). Automatic Construction and Optimization of Layered Network Attack Graph. In: Sobh, T., Elleithy, K., Mahmood, A. (eds) Novel Algorithms and Techniques in Telecommunications and Networking. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3662-9_22
Download citation
DOI: https://doi.org/10.1007/978-90-481-3662-9_22
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3661-2
Online ISBN: 978-90-481-3662-9
eBook Packages: EngineeringEngineering (R0)