J4 ›› 2012, Vol. 34 ›› Issue (2): 9-12.
• 论文 • Previous Articles Next Articles
HE Zhiqiang,LOU Fang,LI Liang
Received:
Revised:
Online:
Published:
Abstract:
Traditional attack graph generation methods have the problem of state explosion with the network scale expansion. Network security administrators are often overwhelmed by holding redundant attack graphs. The complex attack graph is optimized by using attack distance, which can eliminate unnecessary attack paths and choose the optimal attack paths. The administrators can refer to the optimized attack graph and get the defense information. The experimental results show that it retains the most likely attack path and simplifies the attack graph. With the expansion of network scale, the effect has become increasingly evident.
Key words: network attack;network security;attack distance;attack graph
HE Zhiqiang,LOU Fang,LI Liang. Attack Graph Optimization Based on Attack Distance[J]. J4, 2012, 34(2): 9-12.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2012/V34/I2/9