Application of Network Attack Graph in Automated Penetration Test
Xiaohui Duan · Jisuanji gongcheng · 2008
This paper presents a new approach to automatic construction and optimization of the Network Attack Graph(NAG). For solving scalability problem of the NAG, a hierarchy has been adapted for the network structure that can be divided into attack subgraph and attack supergraph. The attack subgraph describes concrete attack scenarios from the source host to the destination host. The attack supergraph described the attacker’s privilege transition processing. This approach reduces the complexity of NAG by simplifying the structure of it.