arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1306.4040cs.CRcs.AI
收藏

不确定性场景下的最优攻击路径算法

An Algorithm to Find Optimal Attack Paths in Nondeterministic Scenarios

Core Security Technologies(Core Security Technologies(核心安全技术公司));ITBA(ITBA(布宜诺斯艾利斯理工学院));Universidad de Buenos Aires(布宜诺斯艾利斯大学)

Carlos Sarraute, Gerardo Richarte, Jorge Lucangeli Obes

摘要:

随着渗透测试框架的发展和复杂性的提高,自动控制渗透测试工具的问题已经成为一个重要的问题。这可以自然地作为攻击规划问题来解决。以前解决这个问题的方法是基于PDDL语言中的动作和资产建模,并使用现成的AI工具来生成攻击计划。然而,这些方法是有限的。特别是,计划是经典的(行动是确定性的),因此无法处理这种形式的攻击计划中涉及的不确定性。我们在此贡献了一个规划模型,捕捉的不确定性的行动,这是建模为每个动作的成功概率的结果。我们提出了高效的规划算法,专门针对这个问题,实现工业规模的运行时性能(能够解决数百台主机和漏洞利用的情况)。这些算法考虑了动作的成功概率及其预期成本(例如,在执行时间或生成的网络流量方面)。因此,我们表明,概率攻击规划可以有效地解决评估大型网络的安全性时出现的情况。两个“原语”,这是用来作为一个框架中的积木分离成两个层次的抽象的整体问题。我们还提出了实验结果与我们的实施,并得出结论,为进一步的工作提出了一些想法。

英文摘要:

As penetration testing frameworks have evolved and have become more complex, the problem of controlling automatically the pentesting tool has become an important question. This can be naturally addressed as an attack planning problem. Previous approaches to this problem were based on modeling the actions and assets in the PDDL language, and using off-the-shelf AI tools to generate attack plans. These approaches however are limited. In particular, the planning is classical (the actions are deterministic) and thus not able to handle the uncertainty involved in this form of attack planning. We herein contribute a planning model that does capture the uncertainty about the results of the actions, which is modeled as a probability of success of each action. We present efficient planning algorithms, specifically designed for this problem, that achieve industrial-scale runtime performance (able to solve scenarios with several hundred hosts and exploits). These algorithms take into account the probability of success of the actions and their expected cost (for example in terms of execution time, or network traffic generated). We thus show that probabilistic attack planning can be solved efficiently for the scenarios that arise when assessing the security of large networks. Two "primitives" are presented, which are used as building blocks in a framework separating the overall problem into two levels of abstraction. We also present the experimental results obtained with our implementation, and conclude with some ideas for further work.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑