Abstraction-based analysis of known and unknown vulnerabilities of critical information infrastructures

The systematic protection of critical information infrastructures requires an analytical process to identify the critical components and their interplay, to determine the threats and vulnerabilities, to assess the risks and to prioritise countermeasures where risk is unacceptable. The abstraction-based approach presented here builds on a model-based construction of an attack graph with constraints given by the network security policy. A unique feature of the presented approach is, that abstract representations of these graphs can be computed that allow comparison of focused views on the behaviour of the system. In order to analyse resilience of critical information infrastructures against exploits of unknown vulnerabilities, generic vulnerabilities for each installed product and affected service are added to the model. The reachability analysis now considers every possible choice of product, and so all alternatives are evaluated in the attack graph. The impact of changes to security policies or network structure can be visualised by differences in the attack graphs. Results of this analysis support the process of dependable configuration of critical information infrastructures.

[1]  Cynthia A. Phillips,et al.  Computer-attack graph generation tool , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[2]  Hervé Debar,et al.  M2D2: A Formal Data Model for IDS Alert Correlation , 2002, RAID.

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

[4]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5]  Somesh Jha,et al.  Two formal analyses of attack graphs , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.

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

[7]  Igor V. Kotenko,et al.  Multi-agent Framework for Simulation of Adaptive Cooperative Defense Against Internet Attacks , 2007, AIS-ADM.

[8]  Ulrich Ultes-Nitsche,et al.  The SH-Verification Tool — Abstraction-Based Verification of Co-operating Systems , 1998, Formal Aspects of Computing.

[9]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[10]  Nora Cuppens-Boulahia,et al.  A Formal Approach to Specify and Deploy a Network Security Policy , 2004, Formal Aspects in Security and Trust.

[11]  Roland Rieke Tool based formal Modelling, Analysis and Visualisation of Enterprise Network Vulnerabilities utilising Attack Graph Exploration , 2004 .

[12]  Roland Rieke,et al.  Abstraction Based Verification of a Parameterised Policy Controlled System , 2007 .

[13]  Igor Kotenko,et al.  Analyzing Network Security using Malefactor Action Graphs , 2006 .

[14]  Ulrich Ultes-Nitsche,et al.  Approximaely Satisfied Properties of Systems and Simple Language Homomorphisms , 1996, Inf. Process. Lett..

[15]  Roland Rieke,et al.  Verification of Cooperating Systems - An Approach Based on Formal Languages , 2000, FLAIRS Conference.

[16]  Roland Rieke,et al.  The SH-Verification Tool , 2000, FLAIRS.

[17]  Peter Ochsenschläger Verification of Cooperating Systems by Simple Homomorphisms Using the Product Net Machine , 2009 .

[18]  Roland Rieke Modelling and Analysing Network Security Policies in a Given Vulnerability Setting , 2006, CRITIS.

[19]  Cynthia A. Phillips,et al.  A graph-based system for network-vulnerability analysis , 1998, NSPW '98.

[20]  Sushil Jajodia,et al.  Multiple coordinated views for network attack graphs , 2005, IEEE Workshop on Visualization for Computer Security, 2005. (VizSEC 05)..

[21]  Sushil Jajodia,et al.  Managing attack graph complexity through visual hierarchical aggregation , 2004, VizSEC/DMSEC '04.