Name
Abstract | ||
|---|---|---|
Existing attack graph generation methods can only generate attack graphs for the single target, and the scale of the generated graphs is too large. To solve these problems, a global attack graph generation method is proposed on the basis of breadth-first search algorithm. The strategies that limit attack steps and success probability of attack paths are adopted to reduce the scale of the attack graph. The experimental results indicate that using the graph which is generated by this method can analyze network vulnerabilities from the global angle. In addition, this method is validated that it is effective to remove the redundancy edges and nodes of the attack graph, consequently reduces the scale of the attack graph. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICNSC.2008.4525217 | ICNSC |
Keywords | Field | DocType |
vulnerability analysis,network security,breadth-first search algorithm,security,security evaluation,global angle,attack graph,global attack graph generation,graph theory,network vulnerabilities,security of data,breadth first search,breadth first search algorithm,national security,computer networks,authorization,information security | Graph theory,Data mining,Graph,Search algorithm,Control theory,Computer science,Breadth-first search,Network security,Algorithm,Redundancy (engineering),Graph bandwidth,Attack graph | Conference |
ISSN | ISBN | Citations |
1810-7869 | 978-1-4244-1686-8 | 2 |
PageRank | References | Authors |
0.40 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dapeng Man | 1 | 29 | 10.54 |
| bing zhang | 2 | 22 | 1.49 |
| Yang Wu | 3 | 69 | 22.62 |
| Wenjin Jin | 4 | 2 | 0.40 |
| Yongtian Yang | 5 | 29 | 8.13 |