Assessing the risk of using vulnerable components

Balzarotti, Davide; Monga, Mattia; Sicari, Sabrina

doi:10.1007/978-0-387-36584-8_6

Cited by 37 publications

(35 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are thus two different ways for breaking the cycle among which we can only choose one. That is, we can either remove the edge from e 4 …”

Section: Fig 3 Cycles In Attack Graphsmentioning

confidence: 99%

“…Referring to the right-hand side of Figure 3, the search will reach c 3 from e 1 (or, reach c 4 from e 2 ) and then stop there, because the predecessor e 3 of c 4 (or, the predecessor e 4 of c 3 ) has not yet been, and will never be, reached. Notice that this is true no matter a cycle is removable (such as in the left-hand side of Figure 3) or not.…”

Section: Computing the Metricmentioning

confidence: 99%

“…This termination of the procedure is actually desirable, because it signals that one or more cycles have been reached. It also indicates entry points of the cycle, that is, those vertices that have at least one of their predecessors reached, such as c 4 and c 3 in the right-hand side of Figure 3. Upon the termination of the main procedure, a sub-procedure will mark vertices inside the encountered cycle(s), and then calculate their cumulative scores by Definition 3.…”

Section: Computing the Metricmentioning

confidence: 99%

“…The work by Balzarotti et al [3] focuses on computing the minimum efforts required for executing each exploit. Based the exploitability concept, a qualitative measure of risk is given in [4].…”

Section: Related Workmentioning

confidence: 99%

“…Based the exploitability concept, a qualitative measure of risk is given in [4]. Another approach measures the relative risk of different configurations using the weakest attacker model, that is the least conditions under which an attack is possible [20].…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

An Attack Graph-Based Probabilistic Security Metric

Wang

Islam

Long

et al. 2008

Lecture Notes in Computer Science

262

201

View full text Add to dashboard Cite

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.

show abstract

“…There are thus two different ways for breaking the cycle among which we can only choose one. That is, we can either remove the edge from e 4 …”

Section: Fig 3 Cycles In Attack Graphsmentioning

confidence: 99%

Section: Computing the Metricmentioning

confidence: 99%

Section: Computing the Metricmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%