How many down? Toward understanding systematic risk in networks

Benjamin Johnson; Aron Laszka; Jens Grossklags

doi:10.1145/2590296.2590308

How many down? Toward understanding systematic risk in networks

Benjamin Johnson, Aron Laszka, Jens Grossklags

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Scopus citations

Abstract

The systematic risk of a networked system depends to a large extent on its topology. In this paper, we explore this dependency using a model of risk propagation from the literature on interdependent security games. Our main area of focus is on the number of nodes that go down after an attack takes place. We develop a simulation algorithm to study the effects of such attacks on arbitrary topologies, and apply this simulation to scale-free networks. We investigate by graphical illustration how the outcome distribution of such networks exhibits correlation effects that increase the likelihood of losing more nodes at once - an effect having direct applications to cyber-insurance.

Original language	English (US)
Title of host publication	ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security
Publisher	Association for Computing Machinery, Inc
Pages	495-500
Number of pages	6
ISBN (Electronic)	9781450328005
DOIs	https://doi.org/10.1145/2590296.2590308
State	Published - Jun 4 2014
Event	9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2014 - Kyoto, Japan Duration: Jun 4 2014 → Jun 6 2014

Publication series

Name	ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security

Other

Other	9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2014
Country/Territory	Japan
City	Kyoto
Period	6/4/14 → 6/6/14

All Science Journal Classification (ASJC) codes

Software
Computer Networks and Communications
Computer Science Applications
Information Systems

Access to Document

10.1145/2590296.2590308

Cite this

Johnson, B., Laszka, A., & Grossklags, J. (2014). How many down? Toward understanding systematic risk in networks. In ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security (pp. 495-500). (ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security). Association for Computing Machinery, Inc. https://doi.org/10.1145/2590296.2590308

Johnson, Benjamin ; Laszka, Aron ; Grossklags, Jens. / How many down? Toward understanding systematic risk in networks. ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security. Association for Computing Machinery, Inc, 2014. pp. 495-500 (ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security).

@inproceedings{bfdea06a7d854895ba78d83bdbc7a427,

title = "How many down? Toward understanding systematic risk in networks",

abstract = "The systematic risk of a networked system depends to a large extent on its topology. In this paper, we explore this dependency using a model of risk propagation from the literature on interdependent security games. Our main area of focus is on the number of nodes that go down after an attack takes place. We develop a simulation algorithm to study the effects of such attacks on arbitrary topologies, and apply this simulation to scale-free networks. We investigate by graphical illustration how the outcome distribution of such networks exhibits correlation effects that increase the likelihood of losing more nodes at once - an effect having direct applications to cyber-insurance.",

author = "Benjamin Johnson and Aron Laszka and Jens Grossklags",

note = "Funding Information: We thank the reviewers for their comments on an earlier draft of the paper. We gratefully acknowledge the support of the Penn State Institute for CyberScience and the National Science Foundation under ITR award CCF-0424422 (TRUST). In addition, this research was partially sponsored by the Army Research Laboratory and was partially accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on. Publisher Copyright: Copyright {\textcopyright} 2014 ACM.; 9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2014 ; Conference date: 04-06-2014 Through 06-06-2014",

year = "2014",

month = jun,

day = "4",

doi = "10.1145/2590296.2590308",

language = "English (US)",

series = "ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security",

publisher = "Association for Computing Machinery, Inc",

pages = "495--500",

booktitle = "ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security",

}

Johnson, B, Laszka, A & Grossklags, J 2014, How many down? Toward understanding systematic risk in networks. in ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security. ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, Association for Computing Machinery, Inc, pp. 495-500, 9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2014, Kyoto, Japan, 6/4/14. https://doi.org/10.1145/2590296.2590308

How many down? Toward understanding systematic risk in networks. / Johnson, Benjamin; Laszka, Aron; Grossklags, Jens.

ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security. Association for Computing Machinery, Inc, 2014. p. 495-500 (ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - How many down? Toward understanding systematic risk in networks

AU - Johnson, Benjamin

AU - Laszka, Aron

AU - Grossklags, Jens

N1 - Funding Information: We thank the reviewers for their comments on an earlier draft of the paper. We gratefully acknowledge the support of the Penn State Institute for CyberScience and the National Science Foundation under ITR award CCF-0424422 (TRUST). In addition, this research was partially sponsored by the Army Research Laboratory and was partially accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on. Publisher Copyright: Copyright © 2014 ACM.

PY - 2014/6/4

Y1 - 2014/6/4

N2 - The systematic risk of a networked system depends to a large extent on its topology. In this paper, we explore this dependency using a model of risk propagation from the literature on interdependent security games. Our main area of focus is on the number of nodes that go down after an attack takes place. We develop a simulation algorithm to study the effects of such attacks on arbitrary topologies, and apply this simulation to scale-free networks. We investigate by graphical illustration how the outcome distribution of such networks exhibits correlation effects that increase the likelihood of losing more nodes at once - an effect having direct applications to cyber-insurance.

AB - The systematic risk of a networked system depends to a large extent on its topology. In this paper, we explore this dependency using a model of risk propagation from the literature on interdependent security games. Our main area of focus is on the number of nodes that go down after an attack takes place. We develop a simulation algorithm to study the effects of such attacks on arbitrary topologies, and apply this simulation to scale-free networks. We investigate by graphical illustration how the outcome distribution of such networks exhibits correlation effects that increase the likelihood of losing more nodes at once - an effect having direct applications to cyber-insurance.

UR - http://www.scopus.com/inward/record.url?scp=84984863583&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84984863583&partnerID=8YFLogxK

U2 - 10.1145/2590296.2590308

DO - 10.1145/2590296.2590308

M3 - Conference contribution

AN - SCOPUS:84984863583

T3 - ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security

SP - 495

EP - 500

BT - ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security

PB - Association for Computing Machinery, Inc

T2 - 9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2014

Y2 - 4 June 2014 through 6 June 2014

ER -

Johnson B, Laszka A, Grossklags J. How many down? Toward understanding systematic risk in networks. In ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security. Association for Computing Machinery, Inc. 2014. p. 495-500. (ASIA CCS 2014 - Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security). doi: 10.1145/2590296.2590308

How many down? Toward understanding systematic risk in networks

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this