论文信息 - Attack Graph and Network Hardening

Attack Graph and Network Hardening

In this chapter, we briefly review some important concepts that are relevant to further discussions. First, we introduce attack graph and its related concepts. Second, we formalize the network hardening problem. Third, we briefly review standard heuristic approaches and their applicability to network hardening.

Sushil Jajodia | Lingyu Wang | Massimiliano Albanese

[1] Sushil Jajodia,et al. Efficient minimum-cost network hardening via exploit dependency graphs , 2003, 19th Annual Computer Security Applications Conference, 2003. Proceedings..

[2] Somesh Jha,et al. Automated generation and analysis of attack graphs , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.

[3] Peter Winker,et al. A Review of Heuristic Optimization Methods in Econometrics , 2008 .

[4] Gilbert Laporte,et al. Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[5] Duminda Wijesekera,et al. Scalable, graph-based network vulnerability analysis , 2002, CCS '02.

[6] Sushil Jajodia,et al. Topological analysis of network attack vulnerability , 2006, PST.

[7] Christian Blum,et al. Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.