Scalable optimal countermeasure selection using implicit enumeration on attack countermeasure trees
- 1 June 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15300889,p. 1-12
Abstract
Constraints such as limited security investment cost precludes a security decision maker from implementing all possible countermeasures in a system. Existing analytical model-based security optimization strategies do not prevail for the following reasons: (i) none of these model-based methods offer a way to find optimal security solution in the absence of probability assignments to the model, (ii) methods scale badly as size of the system to model increases and (iii) some methods suffer as they use attack trees (AT) whose structure does not allow for the inclusion of countermeasures while others translate the non-state-space model (e.g., attack response tree) into a state-space model hence causing state-space explosion. In this paper, we use a novel AT paradigm called attack countermeasure tree (ACT) whose structure takes into account attacks as well as countermeasures (in the form of detection and mitigation events). We use greedy and branch and bound techniques to study several objective functions with goals such as minimizing the number of countermeasures, security investment cost in the ACT and maximizing the benefit from implementing a certain countermeasure set in the ACT under different constraints. We cast each optimization problem into an integer programming problem which also allows us to find optimal solution even in the absence of probability assignments to the model. Our method scales well for large ACTs and we compare its efficiency with other approaches.Keywords
This publication has 18 references indexed in Scilit:
- Analysis of security data from a large computing organization2011
- Cyber security analysis using attack countermeasure trees2010
- Dependability and security models2009
- SHARPE at the age of twenty twoACM SIGMETRICS Performance Evaluation Review, 2009
- Optimal IDS Sensor Placement and Alert Prioritization Using Attack GraphsJournal of Network and Systems Management, 2008
- Automated generation and analysis of attack graphs2005
- Model-based evaluation: from dependability to securityIEEE Transactions on Dependable and Secure Computing, 2004
- Scalable, graph-based network vulnerability analysis2002
- Letter to the Editor—Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming ProblemsOperations Research, 1967
- Minimization of Boolean Functions*Bell System Technical Journal, 1956