防御Active Directory式攻击图的可扩展边阻塞算法
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs
摘要:
Active Directory(AD)是Windows域网络的默认安全管理系统。AD环境自然地描述了攻击图,其中节点表示计算机/帐户/安全组,并且边表示允许攻击者从一个节点获得对另一个节点的访问的现有访问/已知利用。受实际AD用例的启发,我们研究了一个攻击者和一个防御者之间的Stackelberg游戏。有多个入口节点供攻击者选择,并且有一个目标(域管理员)。每条边都有失败率。攻击者选择成功率最大的攻击路径。防守者可以阻挡有限数量的边(即,撤销访问)。防御者的目标是最小化攻击者的成功率。我们利用实际AD图的树状性来设计可扩展的算法。我们提出了两种新的方法,结合理论的固定参数分析和实际的优化技术。对于树宽度较小的图,我们提出了一个基于树分解的动态规划。然后,我们提出了一个通用的方法转换树分解为基础的动态程序的强化学习环境,这导致了一个随时算法,规模更好,但失去了最优性保证。对于具有少量非分裂路径的图(我们专门为AD图发明的参数),我们提出了一种核化技术,该技术可以显着缩小模型,然后通过混合整数规划来解决。实验上,我们的算法可以扩展到处理具有数万个节点的合成AD图。
英文摘要:
Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/accounts/security groups, and edges represent existing accesses/known exploits that allow the attacker to gain access from one node to another. Motivated by practical AD use cases, we study a Stackelberg game between one attacker and one defender. There are multiple entry nodes for the attacker to choose from and there is a single target (Domain Admin). Every edge has a failure rate. The attacker chooses the attack path with the maximum success rate. The defender can block a limited number of edges (i.e., revoke accesses) from a set of blockable edges, limited by budget. The defender's aim is to minimize the attacker's success rate. We exploit the tree-likeness of practical AD graphs to design scalable algorithms. We propose two novel methods that combine theoretical fixed parameter analysis and practical optimisation techniques. For graphs with small tree widths, we propose a tree decomposition based dynamic program. We then propose a general method for converting tree decomposition based dynamic programs to reinforcement learning environments, which leads to an anytime algorithm that scales better, but loses the optimality guarantee. For graphs with small numbers of non-splitting paths (a parameter we invent specifically for AD graphs), we propose a kernelization technique that significantly downsizes the model, which is then solved via mixed-integer programming. Experimentally, our algorithms scale to handle synthetic AD graphs with tens of thousands of nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。