首页> 外文会议>International Joint Conference on Artificial Intelligence >Who Should Pay the Cost: A Game-theoretic Model for Government Subsidized Investments to Improve National Cybersecurity
【24h】

Who Should Pay the Cost: A Game-theoretic Model for Government Subsidized Investments to Improve National Cybersecurity

机译:谁应该支付成本:政府补贴投资的游戏 - 理论模型,以改善国家网络安全

获取原文

摘要

Due to recent cyber attacks, cybersecurity is becoming more critical. A single attack (e.g., WannaCry ransomware attack) can cause as much as $4 billion in damage. However, the cybersecurity investment by companies is far from satisfactory. Therefore, governments (e.g., in the UK) launch grants and subsidies to help companies to boost their cybersecurity to create a safer national cyber environment. Computing the optimal allocation is challenging due to limited subsidies, the interdependence between companies and the presence of strategic cyber attackers. To tackle the government's allocation problem, we introduce a Stackelberg game model where the government first commits to an allocation and the companies/users and attacker simultaneously determine their protection and attack (pure or mixed) strategies, respectively. For the pure-strategy case, while there may not be a feasible allocation in general, we prove that computing an optimal allocation is NP-hard and propose a linear reverse convex program when the attacker can attack all users. For the mixed-strategy case, we show that there is a polynomial time algorithm to find an optimal allocation when the attacker has a single-attack capability. We then provide a heuristic algorithm, based on best-response-gradient dynamics, to find an effective allocation in general settings. Experimentally, we show that our heuristic algorithm is effective and significantly outperforms baselines on synthetic and real data.
机译:由于最近的网络攻击,网络安全变得更加重要。单一攻击(例如,Wannacry赎金软件攻击)可能导致损坏多达40亿美元。但是,公司的网络安全投资远非令人满意。因此,政府(例如,英国)发起拨款和补贴,帮助公司提高他们的网络安全,以创造一个更安全的国家网络环境。由于补贴有限,公司之间的相互依存和战略网络攻击者的存在,计算最优分配是具有挑战性的。为了解决政府的分配问题,我们介绍了一个Stackelberg游戏模型,政府首先致力于分配,公司/用户和攻击者同时分别确定其保护和攻击(纯粹或混合)策略。对于纯策略案例,虽然通常存在不可行的分配,但我们证明计算最佳分配是NP - 硬,并且当攻击者可以攻击所有用户时提出线性反向凸面编程。对于混合策略的情况,我们表明,当攻击者具有单攻击能力时,存在多项式时间算法可以找到最佳分配。然后,我们基于最佳响应梯度动态提供了一种启发式算法,可以在常规设置中找到有效的分配。实验,我们表明我们的启发式算法是有效的,并且显着优于合成和实际数据的基线。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号