Understanding complex network attack graphs through clustered adjacency matrices

Proceedings - Annual Computer Security Applications Conference, ACSAC

Volumn 2005, Issue , 2005, Pages 160-169

  Noel, Steven ^a   Jajodia, Sushil ^a  

^a George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRIX; NETWORK ATTACK GRAPHS; QUADRATIC COMPLEXITY;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 33846293304     PISSN: 10639527     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSAC.2005.58     Document Type: Conference Paper

References (16)

1. D. Chakrabarti, S. Papadimitriou, D. Modha, C. Faloutsos, "Fully Automatic Cross-Associations," in Proceedings of the 10th ACM International Conference on Knowledge Discovery & Data Mining, Seattle, Washington, August 2004.
2. S. Jajodia, S. Noel, B. O'Berry, "Topological Analysis of Network Attack Vulnerability," in Managing Cyber Threats: Issues, Approaches and Challenges, V. Kumar, J. Srivastava, A. Lazarevic (eds.), Kluwer Academic Publisher, 2005.
3. th Annual Computer Security Applications Conference, Tucson, Arizona, December 2004.
4. S. Noel, S. Jajodia, "Managing Attack Graph Complexity through Visual Hierarchical Aggregation," in Proceedings of the ACM CCS Workshop on Visualization and Data Mining for Computer Security, Fairfax, VA, October 2004.
5. th Annual Network and Distributed System Security Symposium, February 2004.
6. th Annual Computer Security Applications Conference, Las Vegas, Nevada, December 2003.
7. th Annual Computer Security Applications Conference, Las Vegas, Nevada, December 2002.
8. th ACM Conference on Computer and Communications Security, Washington, DC, November 2002.
9. F. Cuppens, A. Miege, "Alert Correlation in a Cooperative Intrusion Detection Framework," in Proceedings of the 2002 IEEE Symposium on Security and Privacy, May 2002.
10. G. Di Battista, P. Eades, R. Tamassia, I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, 1999.
11. P. Eades, Q.-W. Feng, "Multilevel Visualization of Clustered Graphs," in Proceedings of the Symposium on Graph Drawing, September 1996.
12. K. Lakkaraju, W. Yurcik, A. Lee, "NVisionIP: NetFlow Visualizations of System State for Security Situational Awareness," in Proceedings of the CCS Workshop on Visualization and Data Mining for Computer Security, Fairfax, VA, October 2004.
13. J. McPherson, K.-L. Ma, P. Krystosek, T. Bartoletti, M. Christensen, "PortVis: A Tool for Port-Based Detection of Security Events," in Proceedings of the CCS Workshop on Visualization and Data Mining for Computer Security, Fairfax, VA, October 2004.
14. P. Grünwald, "A Tutorial Introduction to the Minimum Description Length Principle," in Advances in Minimum Description Length: Theory and Applications, P. Grünwald, I. Myung, M. Pitt (eds.), MIT Press, 2005.
15. E. Nuutila, Efficient Transitive Closure Computation in Large Digraphs, Ph.D. dissertation, Acta Polytechnica Scandinavica, Helsinki, 1995.
16. Nessus open source vulnerability scanner project, web page, http://www.nessus.org/. last accessed May 2005.