Using Genetic Algorithm for Optimal Security Hardening in Risk Flow Attack Graph

• Fangfang Dai,
• Kangfeng Zheng,
• Binwu,
• Shoushan Luo,

Vol. 9, No. 5, May 30, 2015
10.3837/tiis.2015.05.021, Download Paper (Free):

• genetic algorithm
• security hardening
• Attack Graph
• vulnerabilities
• network risk

Abstract

Network environment has been under constant threat from both malicious attackers and inherent vulnerabilities of network infrastructure. Existence of such threats calls for exhaustive vulnerability analyzing to guarantee a secure system. However, due to the diversity of security hazards, analysts have to select from massive alternative hardening strategies, which is laborious and time-consuming. In this paper, we develop an approach to seek for possible hardening strategies and prioritize them to help security analysts to handle the optimal ones. In particular, we apply a Risk Flow Attack Graph (RFAG) to represent network situation and attack scenarios, and analyze them to measure network risk. We also employ a multi-objective genetic algorithm to infer the priority of hardening strategies automatically. Finally, we present some numerical results to show the performance of prioritizing strategies by network risk and hardening cost and illustrate the application of optimal hardening strategy set in typical cases. Our novel approach provides a promising new direction for network and vulnerability analysis to take proper precautions to reduce network risk.

Statistics

Cite this article