Understanding complex network attack graphs through clustered adjacency matrices
暂无分享,去创建一个
[1] Esko Nuutila,et al. Efficient transitive closure computation in large digraphs , 1995 .
[2] Peter Eades,et al. Multilevel Visualization of Clustered Graphs , 1996, GD.
[3] Frédéric Cuppens,et al. Alert correlation in a cooperative intrusion detection framework , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.
[4] Duminda Wijesekera,et al. Scalable, graph-based network vulnerability analysis , 2002, CCS '02.
[5] Steven Noel,et al. Representing TCP/IP connectivity for topological analysis of network security , 2002, 18th Annual Computer Security Applications Conference, 2002. Proceedings..
[6] Sushil Jajodia,et al. Efficient minimum-cost network hardening via exploit dependency graphs , 2003, 19th Annual Computer Security Applications Conference, 2003. Proceedings..
[7] Sushil Jajodia,et al. Managing attack graph complexity through visual hierarchical aggregation , 2004, VizSEC/DMSEC '04.
[8] Kwan-Liu Ma,et al. PortVis: a tool for port-based detection of security events , 2004, VizSEC/DMSEC '04.
[9] Christos Faloutsos,et al. Fully automatic cross-associations , 2004, KDD.
[10] William Yurcik,et al. NVisionIP: netflow visualizations of system state for security situational awareness , 2004, VizSEC/DMSEC '04.
[11] Sushil Jajodia,et al. Correlating intrusion events and building attack scenarios through attack graph distances , 2004, 20th Annual Computer Security Applications Conference.
[12] Peng Ning,et al. Building Attack Scenarios through Integration of Complementary Alert Correlation Method , 2004, NDSS.
[13] Peter Grünwald,et al. A tutorial introduction to the minimum description length principle , 2004, ArXiv.
[14] Sushil Jajodia,et al. Topological analysis of network attack vulnerability , 2006, PST.