Efficient Network Protection Games Against Multiple Types Of Strategic Attackers
Efficient Network Protection Games Against Multiple Types Of Strategic Attackers
复制标题
DOI：
10.1109/icassp39728.2021.9413758
复制
发表时间：
2021-06
期刊：
影响因子：
--
通讯作者：
Zhifan Xu;M. Baykal-Gursoy
中科院分区：
文献类型：
--
作者：
Zhifan Xu;M. Baykal-Gursoy
针对具有N个单元的异质网络系统，研究了针对不同类型攻击者的网络保护博弈问题。防御者通过将资源应用于联网的单位，可以降低单位的脆弱性。同时，防御方需要考虑使用防御资源的成本。针对两种不同类型的攻击者，研究了两种非零和纳什对策。第一种类型试图根据与联网单位相关的安全资产的价值最大化损害，而第二种类型的目标是渗透到网络中。分析表明，存在一个确定在第一次博弈均衡策略中受保护的单位集合的截止值，而在第二次博弈的均衡策略中，要么覆盖所有单位，要么不覆盖任何单位。介绍了网络保护游戏在无线通信网络安全中的应用。
This paper considers network protection games against different types of attackers for a heterogeneous network system with N units. A defender, by applying resources to networked units, can decrease the units’ vulnerabilities. At the same time, the defender needs to take into account the cost of using defense resources. Two non-zero sum Nash games against two different types of attackers are studied. The first type tries to maximize damage based on the value of security assets related to networked units, while the second type aims at infiltrating the network. The analyses show that there exists a cut-off index determining the set of units that will be protected in the equilibrium strategies of the first game, while either all units or none will be covered in the equilibria of the second game. An application of the network protection game to secure wireless communication networks is presented.