A Kolmogorov Complexity Approach for Measuring Attack Path Complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A Kolmogorov Complexity Approach for Measuring Attack Path Complexity


The difficulty associated with breaching an enterprise network is commensurate with the security of that network. A security breach, or a security policy violation, occurs as a result of an attacker successfully executing some attack path. The difficulty associated with this attack path, then, is critical to understanding how secure a given network is. Currently, however, there are no consistent methods for measuring attack path complexity that make the assumptions of a modeler explicit while providing flexibility in how the modeler models the attack path. To provide these desirable attributes, we propose a regular-expressions-inspired language whose rationale for attack path complexity measurement is based on Kolmogorov Complexity. After detailing our Kolmogorov Complexity-based method, we demonstrate how it can be applied to a novel security metric: the K-step Capability Accumulation metric–a metric that defines the security of a network in terms of the network assets attainable for attack effort exerted.
Fichier principal
Vignette du fichier
978-3-642-21424-0_23_Chapter.pdf (351.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01567600 , version 1 (24-07-2017)





Nwokedi Idika, Bharat Bhargava. A Kolmogorov Complexity Approach for Measuring Attack Path Complexity. 26th International Information Security Conference (SEC), Jun 2011, Lucerne, Switzerland. pp.281-292, ⟨10.1007/978-3-642-21424-0_23⟩. ⟨hal-01567600⟩
74 View
38 Download



Gmail Facebook Twitter LinkedIn More