Optimal security hardening using multi-objective optimization on attack tree models of networks

Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also addressed the problem of minimizing the total cost of implementing these hardening measures, given costs for individual measures. However, system administrators are often faced with a more challenging problem since they have to work within a fixed budget which may be less than the minimum cost of system hardening. Their problem is how to select a subset of security hardening measures so as to be within the budget and yet minimize the residual damage to the system caused by not plugging all required security holes. In this work, we develop a systematic approach to solve this problem by formulating it as a multi-objective optimization problem on an attack tree model of the system and then use an evolutionary algorithm to solve it. Categories and Subject Descriptors C.2.3 [Computer-Communication Network]: Netw...

• Type: Conference
• Year: 2007
• Where: CCS
• Authors: Rinku Dewri, Nayot Poolsappasit, Indrajit Ray, Darrell Whitley
• Keywords: Attack Trees, CCS 2007, Multi-objective Optimization Problem, Security Hardening Measures, Security Privacy