2014 IEEE 27th Computer Security Foundations Symposium (CSF) (2014)

Vienna, Austria

July 19, 2014 to July 22, 2014

ISSN: 1063-6900

ISBN: 978-1-4799-4290-9

pp: 325-336

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSF.2014.30

Benjamin Johnson , Univ. of California, Berkeley, Berkeley, CA, USA

Aron Laszka , Budapest Univ. of Technol. & Econ., Budapest, Hungary

Jens Grossklags , Pennsylvania State Univ., University Park, PA, USA

ABSTRACT

This risk of catastrophe from an attack is a consequence of a network's structure formed by the connected individuals, businesses and computer systems. Understanding the likelihood of extreme events, or, more generally, the probability distribution of the number of compromised nodes is an essential requirement to provide risk-mitigation or cyber-insurance. However, previous network security research has not considered features of these distributions beyond their first central moments, while previous cyber-insurance research has not considered the effect of topologies on the supply side. We provide a mathematical basis for bridging this gap: we study the complexity of computing these loss-number distributions, both generally and for special cases of common real-world networks. In the case of scale-free networks, we demonstrate that expected loss alone cannot determine the riskiness of a network, and that this riskiness cannot be naively estimated from smaller samples, which highlights the lack/importance of topological data in security incident reporting.

INDEX TERMS

Security, Insurance, Computational modeling, Systematics, Investment, Mathematical model, Computers

CITATION

B. Johnson, A. Laszka and J. Grossklags, "The Complexity of Estimating Systematic Risk in Networks,"

*2014 IEEE 27th Computer Security Foundations Symposium (CSF)*, Vienna, Austria, 2014, pp. 325-336.

doi:10.1109/CSF.2014.30

CITATIONS