Finding the minimum cut set in attack graphs using genetic algorithms
Finding the minimum cut set in attack graphs using genetic algorithms
复制标题
使用遗传算法查找攻击图中的最小割集
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Martin J. Reed
中科院分区：
文献类型：
--
作者：
M. Alhomidi;Martin J. Reed
攻击图是有用的工具，既可以显示简单系统中可能的攻击向量，也可以作为更复杂系统的分析工具。本文考虑了后一种情况，以及如何使用攻击图来最大限度地降低部署对策的成本。具体来说，我们开发了一种方法来找到依赖攻击图中的最小割集使用遗传算法（GA）。最小割集是一种自然图表示，描述了一组防止攻击者到达其目标的安全对策。工作表明，该问题自然映射到一个二进制编码的GA，并给出了令人满意的结果，而不需要部署问题的具体GA运营商。
Attack graphs are useful tools to both display possible attack vectors in simple systems and as an analysis tool for more complex systems. This paper considers the latter case and how an attack graph can be used to minimize the cost of deploying countermeasures. Specifically we develop an approach to find the minimum cut set in dependency attack graphs using a genetic algorithm (GA). The minimum cut set is a natural graph representation describing a set of security countermeasures that prevent attackers reaching their targets. The work shows that the problem maps naturally to a binary encoded GA and gives satisfactory results without the need to deploy problem specific GA operators.