Identifying a preferred countermeasure strategy for attack graphs

Authors:
Ganesh Ram Santhanam;Zachary J. Oster;Samik Basu
Affiliations:
Iowa State University, Ames, Iowa;Iowa State University, Ames, Iowa;Iowa State University, Ames, Iowa
Venue:
Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop
Year:
2013

Citing 6
Cited 0

NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Two Formal Analys s of Attack Graphs

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Automated Generation and Analysis of Attack Graphs

SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
On graphical modeling of preference and importance

Journal of Artificial Intelligence Research
Conditional importance networks: a graphical language for representing ordinal, monotonic preferences over sets of goods

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Automating analysis of qualitative preferences in goal-oriented requirements engineering

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Attack graphs capture sequences of actions that an intruder can take to lead the system to an undesirable state. They have proven to be important tools for administrators to analyse and devise countermeasures to be deployed in the face of an attack. We consider preferences over countermeasures that the administrator may hold when devising a strategy to thwart the attacker's goals. We present a formalism based on CI-nets to represent and reason about such preferences. We present a method to find an intervention strategy in terms of a set of countermeasures that is guaranteed to thwart any attack on the system, which is also most preferred.