New Insights into Approaches to Evaluating Intention and Path for Network Multistep Attacks

Abstract EN

The attack graph (AG) is an abstraction technique that reveals the ways an attacker can use to leverage vulnerabilities in a given network to violate security policies.

The analyses developed to extract security-relevant properties are referred to as AG-based security evaluations.

In recent years, many evaluation approaches have been explored.

However, they are generally limited to the attacker’s “monotonicity” assumption, which needs further improvements to overcome the limitation.

To address this issue, the stochastic mathematical model called absorbing Markov chain (AMC) is applied over the AG to give some new insights, namely, the expected success probability of attack intention (EAIP) and the expected attack path length (EAPL).

Our evaluations provide the preferred mitigating target hosts and the vulnerabilities patching prioritization of middle hosts.

Tests on the public datasets DARPA2000 and Defcon’s CTF23 both verify that our evaluations are available and reliable.