CSDL Home IEEE Transactions on Dependable and Secure Computing 2012 vol.9 Issue No.01 - January/February
Issue No.01 - January/February (2012 vol.9)
Nwokedi Idika , Purdue University, West Lafayette
Bharat Bhargava , Purdue University, West Lafayette
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2010.61
The attack graph is an abstraction that reveals the ways an attacker can leverage vulnerabilities in a network to violate a security policy. When used with attack graph-based security metrics, the attack graph may be used to quantitatively assess security-relevant aspects of a network. The Shortest Path metric, the Number of Paths metric, and the Mean of Path Lengths metric are three attack graph-based security metrics that can extract security-relevant information. However, one's usage of these metrics can lead to misleading results. The Shortest Path metric and the Mean of Path Lengths metric fail to adequately account for the number of ways an attacker may violate a security policy. The Number of Paths metric fails to adequately account for the attack effort associated with the attack paths. To overcome these shortcomings, we propose a complimentary suite of attack graph-based security metrics and specify an algorithm for combining the usage of these metrics. We present simulated results that suggest that our approach reaches a conclusion about which of two attack graphs correspond to a network that is most secure in many instances.
Network-level security and protection, measurement, measurement techniques.
Nwokedi Idika, Bharat Bhargava, "Extending Attack Graph-Based Security Metrics and Aggregating Their Application", IEEE Transactions on Dependable and Secure Computing, vol.9, no. 1, pp. 75-85, January/February 2012, doi:10.1109/TDSC.2010.61