Name
Abstract | ||
|---|---|---|
Attack graphs play important roles in analyzing network security vulnerabilities, and previous works have provided meaningful conclusions on the generation and security measurement of attack graphs. However, it is still hard for us to understand attack graphs in a large network, and few suggestions have been proposed to prevent inside malicious attackers from attacking networks. To address these problems, we propose a novel approach to generate and describe attack graphs. Firstly, we construct a two-layer attack graph, where the upper layer is a hosts access graph and the lower layer is composed of some host-pair attack graphs. Compared with previous works, our attack graph has simpler structures, and reaches the best upper bound of computation cost in O(N2). Furthermore, we introduce the adjacency matrix to efficiently evaluate network security, with overall evaluation results presented by gray scale images vividly. Thirdly, by applying prospective damage and important weight factors on key hosts with crucial resources, we can create prioritized lists of potential threatening hosts and stepping stones, both of which can help network administrators to harden network security. Analysis on computation cost shows that the upper bound computation cost of our measurement methodology is O(N3), which could also be completed in real time. Finally, we give some examples to show how to put our methods in practice. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ACSAC.2009.22 | ACSAC |
Keywords | Field | DocType |
prioritized list,previous work,network security,hosts access graph,network security vulnerabilities,network administrator,two-layer attack graph,large network,attack graphs,potential threatening hosts,adjacency matrix,network security vulnerability,software performance evaluation,computation cost,computational complexity,security measurement,attack graph,host-pair attack graphs,graph theory,host-pair attack graph,two-layer attack graphs,network security evaluation,security of data,computational modeling,data mining,visualization,security,upper bound,probability | Graph theory,Adjacency matrix,Computer science,Visualization,Computer security,Upper and lower bounds,Network security,Pre-play attack,Theoretical computer science,Computation,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1063-9527 | 978-0-7695-3919-5 | 15 |
PageRank | References | Authors |
0.74 | 20 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anming Xie | 1 | 17 | 1.45 |
| Zhuhua Cai | 2 | 90 | 7.48 |
| Cong Tang | 3 | 15 | 0.74 |
| Jianbin Hu | 4 | 179 | 22.43 |
| Zhong Chen | 5 | 503 | 58.35 |