首页> 外文期刊>IEEE transactions on information forensics and security >An Intelligence-Driven Security-Aware Defense Mechanism for Advanced Persistent Threats
【24h】

An Intelligence-Driven Security-Aware Defense Mechanism for Advanced Persistent Threats

机译:智能驱动的安全意识防御机制,用于持久威胁

获取原文
获取原文并翻译 | 示例
           

摘要

Combined with many different attack forms, advanced persistent threats (APTs) are becoming a major threat to cyber security. Existing security protection works typically either focus on one-shot case, or separate detection from response decisions. Such practices lead to tractable analysis, but miss key inherent APTs persistence and risk heterogeneity. To this end, we propose a Lyapunov-based security-aware defense mechanism backed by threat intelligence, where robust defense strategy-making is based on acquired heterogeneity knowledge. By exploring temporal evolution of risk level, we introduce priority-aware virtual queues, which together with attack queues, enable security-aware response among hosts. Specifically, a long-term time average profit maximization problem is formulated. We first develop risk admission control policy to accommodate hosts’ risk tolerance and response capacity. Under multiple attacker resources, defense control policy is implemented on two-stage decisions, involving proportional fair resource allocation and host-attack assignment. In particular, distributed auction-based assignment algorithm is designed to capture uncertainty in the number of resolved attacks, where high-risk host-attack pairs are prioritized over others. We theoretically prove our mechanism can guarantee bounded queue backlogs, profit optimality, no underflow condition, and robustness to detection errors. Simulations on real-world data set corroborate theoretical analysis and reveal the importance of security awareness.
机译:结合许多不同的攻击形式,高级持续威胁(APT)成为对网络安全的主要威胁。现有的安全保护工作通常只针对一次性情况,或者与响应决策分开进行检测。这样的做法导致易于分析,但错过了关键的固有APT持久性和风险异质性。为此,我们提出了一种基于Lyapunov的,以威胁情报为后盾的安全感知防御机制,其中基于获得的异质性知识制定可靠的防御策略。通过探索风险级别的时间演变,我们引入了优先级感知的虚拟队列,该队列与攻击队列一起使主机之间能够进行安全感知的响应。具体地,提出了长期时间平均利润最大化问题。我们首先制定风险准入控制政策,以适应主机的风险承受能力和响应能力。在多个攻击者资源下,防御控制策略是分两阶段执行的,涉及成比例的公平资源分配和主机攻击分配。尤其是,基于分布式拍卖的分配算法旨在捕获已解决攻击次数中的不确定性,在这些攻击中,高风险主机攻击对的优先级高于其他攻击。我们从理论上证明了我们的机制可以保证有限制的队列积压,利润最优,无下溢情况以及对检测错误的鲁棒性。对真实数据集的仿真证实了理论分析,并揭示了安全意识的重要性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号