Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices

We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show attacker reachability across the network for a given number of attack steps, culminating in transitive closure for attack prediction over all possible number of steps. This reachability analysis provides a concise summary of the impact of network configuration changes on the attack graph. Using our framework, we also place intrusion alarms in the context of vulnerabilitybased attack graphs, so that false alarms become apparent and missed detections can be inferred. We introduce a graphical technique that shows multiple-step attacks by matching rows and columns of the clustered adjacency matrix. This allows attack impact/responses to be identified and prioritized according to the number of attack steps to victim machines, and allows attack origins to be determined. Our techniques have quadratic complexity in the s...

• Type: Conference
• Year: 2005
• Where: ACSAC
• Authors: Steven Noel, Sushil Jajodia
• Keywords: ACSAC 2005, Attack Graph, Attack Steps, Clustered Adjacency, Security Privacy