arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1812.09660cs.AIcs.CRcs.GT
收藏

移动目标防御的马尔可夫博弈模型及其在云网络威胁检测中的应用

Markov Game Modeling of Moving Target Defense for Strategic Detection of Threats in Cloud Networks

Arizona State University(亚利桑那州立大学)

Ankur Chowdhary, Sailik Sengupta, Dijiang Huang, Subbarao Kambhampati

摘要:

大规模云网络中关键数据的处理和存储需要可扩展的安全解决方案。事实证明,部署所有可能的安全措施都会消耗宝贵的计算和网络资源,而这些资源是云服务提供商的主要卖点。因此,最近有兴趣发展移动目标防御(MTD)机制,帮助一个优化的联合目标,最大限度地提高安全性,同时确保对性能的影响最小化。通常,这些技术将隐形对手的多阶段攻击问题建模为单步攻击检测游戏,使用图连接性度量作为衡量性能的启发式方法,从而(1)丢失了为大型云网络设计的图论模型中固有的有价值信息,以及(2)提出了某些对性能具有不对称影响的策略。在这项工作中,我们利用云网络的攻击图中的知识来制定零和马尔可夫博弈,并使用通用漏洞评分系统(CVSS)来为这个游戏提供有意义的实用价值。然后,我们表明,放置检测机制对对手的最佳策略相当于计算混合最小最大均衡的马尔可夫博弈。我们将使用我们的方法获得的收益与目前用于云网络安全的其他技术进行比较,从而显示其有效性。最后,我们强调了如何将该方法用于一个小型的真实云系统。

英文摘要:

The processing and storage of critical data in large-scale cloud networks necessitate the need for scalable security solutions. It has been shown that deploying all possible security measures incurs a cost on performance by using up valuable computing and networking resources which are the primary selling points for cloud service providers. Thus, there has been a recent interest in developing Moving Target Defense (MTD) mechanisms that helps one optimize the joint objective of maximizing security while ensuring that the impact on performance is minimized. Often, these techniques model the problem of multi-stage attacks by stealthy adversaries as a single-step attack detection game using graph connectivity measures as a heuristic to measure performance, thereby (1) losing out on valuable information that is inherently present in graph-theoretic models designed for large cloud networks, and (2) coming up with certain strategies that have asymmetric impacts on performance. In this work, we leverage knowledge in attack graphs of a cloud network in formulating a zero-sum Markov Game and use the Common Vulnerability Scoring System (CVSS) to come up with meaningful utility values for this game. Then, we show that the optimal strategy of placing detecting mechanisms against an adversary is equivalent to computing the mixed Min-max Equilibrium of the Markov Game. We compare the gains obtained by using our method to other techniques presently used in cloud network security, thereby showing its effectiveness. Finally, we highlight how the method was used for a small real-world cloud system.

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

↑