论文标题

使用游戏理论优化脆弱性驱动的蜂蜜流量

Optimizing Vulnerability-Driven Honey Traffic Using Game Theory

论文作者

Anjum, Iffat, Miah, Mohammad Sujan, Zhu, Mu, Sharmin, Nazia, Kiekintveld, Christopher, Enck, William, Singh, Munindar P

论文摘要

企业越来越关注对手,这些对手在几个月甚至几年的过程中缓慢而故意利用资源。该杀戮链的一个关键步骤是网络侦察,历史上一直活跃(例如,网络扫描),因此可以检测到。但是,新的网络技术增加了被动网络侦察的可能性,后卫在很大程度上无法检测到。在本文中,我们提出了SNAZ,该技术使用欺骗性的蜂蜜交通来混淆通过被动网络侦察获得的知识。我们提出了一个两人非零和Stackelberg游戏模型,该模型的特征是在意识到SNAZ的对手的情况下,防守者应如何部署蜂蜜流量。在此过程中,我们证明了最佳防御者策略的存在,这些策略将劝阻对手在网络流量中观察到的真正漏洞的存在,或者在试图在不知不觉中攻击入侵检测节点时揭示对手的存在。

Enterprises are increasingly concerned about adversaries that slowly and deliberately exploit resources over the course of months or even years. A key step in this kill chain is network reconnaissance, which has historically been active (e.g., network scans) and therefore detectable. However, new networking technology increases the possibility of passive network reconnaissance, which will be largely undetectable by defenders. In this paper, we propose Snaz, a technique that uses deceptively crafted honey traffic to confound the knowledge gained through passive network reconnaissance. We present a two-player non-zero-sum Stackelberg game model that characterizes how a defender should deploy honey traffic in the presence of an adversary who is aware of Snaz. In doing so, we demonstrate the existence of optimal defender strategies that will either dissuade an adversary from acting on the existence of real vulnerabilities observed within network traffic, or reveal the adversary's presence when it attempts to unknowingly attack an intrusion detection node.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源