An Attack Graph-Based Probabilistic Security Metric

  • Authors:
  • Lingyu Wang;Tania Islam;Tao Long;Anoop Singhal;Sushil Jajodia

  • Affiliations:
  • Concordia Institute for Information Systems Engineering, Concordia University, Montreal, Canada QC H3G 1M8;Concordia Institute for Information Systems Engineering, Concordia University, Montreal, Canada QC H3G 1M8;Concordia Institute for Information Systems Engineering, Concordia University, Montreal, Canada QC H3G 1M8;Computer Security Division, National Institute of Standards and Technology, Gaithersburg, USA MD 20899;Center for Secure Information Systems, George Mason University, Fairfax, USA VA 22030-4444

  • Venue:
  • Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

To protect critical resources in today's networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities. This now becomes feasible due to a model of causal relationships between vulnerabilities, namely, attack graph. This paper proposes an attack graph-based probabilistic metric for network security and studies its efficient computation. We first define the basic metric and provide an intuitive and meaningful interpretation to the metric. We then study the definition in more complex attack graphs with cycles and extend the definition accordingly. We show that computing the metric directly from its definition is not efficient in many cases and propose heuristics to improve the efficiency of such computation.