首页> 外文会议>International Conference on Decision and Game Theory for Security >Optimal Thresholds for Anomaly-Based Intrusion Detection in Dynamical Environments
【24h】

Optimal Thresholds for Anomaly-Based Intrusion Detection in Dynamical Environments

机译:动态环境中基于异常的入侵检测的最佳阈值

获取原文

摘要

In cyber-physical systems, malicious and resourceful attackers could penetrate a system through cyber means and cause significant physical damage. Consequently, early detection of such attacks becomes integral towards making these systems resilient to attacks. To achieve this objective, intrusion detection systems (IDS) that are able to detect malicious behavior early enough can be deployed. However, practical IDS are imperfect and sometimes they may produce false alarms even for normal system behavior. Since alarms need to be investigated for any potential damage, a large number of false alarms may increase the operational costs significantly. Thus, IDS need to be configured properly, as oversensitive IDS could detect attacks very early but at the cost of a higher number of false alarms. Similarly, IDS with very low sensitivity could reduce the false alarms while increasing the time to detect the attacks. The configuration of IDS to strike the right balance between time to detecting attacks and the rate of false positives is a challenging task, especially in dynamic environments, in which the damage caused by a successful attack is time-varying. In this paper, using a game-theoretic setup, we study the problem of finding optimal detection thresholds for anomaly-based detectors implemented in dynamical systems in the face of strategic attacks. We formulate the problem as an attacker-defender security game, and determine thresholds for the detector to achieve an optimal trade-off between the detection delay and the false positive rates. In this direction, we first provide an algorithm that computes an optimal fixed threshold that remains fixed throughout. Second, we allow the detector's threshold to change with time to further minimize the defender's loss, and we provide a polynomial-time algorithm to compute time-varying thresholds, which we call adaptive thresholds. Finally, we numerically evaluate our results using a water-distribution network as a case study.
机译:在网络 - 物理系统中,恶意和资源丰富的攻击者可以通过网络手段穿透系统并造成显着的物理损坏。因此,这种攻击的早期检测变得一体化,朝向使这些系统适应攻击。为了实现这种目标,可以部署能够早期检测到足够恶意行为的入侵检测系统(IDS)。但是,即使对于正常的系统行为,实用ID是不完善的,有时它们也可能产生误报。由于需要对任何潜在的损坏进行调查,因此大量误报可能会显着提高运营成本。因此,需要正确配置ID,因为过敏ID可以非常早期地检测到攻击,而是以更高数量的误报例检测攻击。类似地,具有非常低灵敏度的ID可以减少误报,同时增加检测攻击的时间。 ID的配置在时间到检测攻击的时间与误报的速度和误报的速度是一个具有挑战性的任务,特别是在动态环境中,其中由成功攻击造成的损坏是时变的。在本文中,使用游戏理论设置,我们研究了在战略攻击面前为动态系统中实施的基于异常的检测器的最佳检测阈值的问题。我们将问题作为攻击者 - 后卫安全游戏,并确定检测器的阈值,以在检测延迟和假阳性率之间实现最佳权衡。在此方向上,我们首先提供一种计算始终固定的最佳固定阈值的算法。其次,我们允许探测器的阈值随着时间的推移而改变,以进一步降低防御者的损失,并且我们提供了一种计算时间变化阈值的多项式时间算法,我们调用自适应阈值。最后,我们使用水分配网络计算我们的结果作为案例研究。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号