Computing Cross Associations for Attack Graphs and Other Applications

Applications in information security, data mining, e-commerce, information retrieval and network management require the analysis of large graphs in order to discover homogeneous groupings of rows and columns, called cross associations. We show that finding an optimal cross association is NP-complete. Furthermore, we give a heuristic algorithm with an O(n4) running time for finding good cross associations

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

[2]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[3]  Stefan Szeider Generalizations of matched CNF formulas , 2005, Annals of Mathematics and Artificial Intelligence.

[4]  Christos Faloutsos,et al.  Fully automatic cross-associations , 2004, KDD.

[5]  Sushil Jajodia,et al.  Understanding complex network attack graphs through clustered adjacency matrices , 2005, 21st Annual Computer Security Applications Conference (ACSAC'05).

[6]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[7]  Dorit S. Hochbaum,et al.  Approximating Clique and Biclique Problems , 1998, J. Algorithms.

[8]  Jeannette M. Wing,et al.  Tools for Generating and Analyzing Attack Graphs , 2003, FMCO.

[10]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[11]  Dana Ron,et al.  A New Conceptual Clustering Framework , 2004, Machine Learning.

[12]  René Peeters,et al.  The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..

[13]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Petr Kovár,et al.  On biclique coverings , 2008, Discret. Math..

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

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