SOCMTD: Selecting Optimal Countermeasure for Moving Target Defense Using Dynamic Game

被引:6
|
作者
Hu, Hao [1 ,2 ]
Liu, Jing [2 ]
Tan, Jinglei [2 ]
Liu, Jiang [2 ]
机构
[1] State Key Lab Math Engn & Adv Comp, Zhengzhou 450001, Peoples R China
[2] Zhengzhou Informat Sci & Technol Inst, Zhengzhou 450001, Peoples R China
基金
中国国家自然科学基金;
关键词
moving target defense; dynamic defense; signal game; optimal countermeasure; cost and benefit;
D O I
10.3837/tiis.2020.10.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Moving target defense, as a 'game-changing' security technique for network warfare, realizes proactive defense by increasing network dynamics, uncertainty and redundancy. How to select the best countermeasure from the candidate countermeasures to maximize defense payoff becomes one of the core issues. In order to improve the dynamic analysis for existing decision-making, a novel approach of selecting the optimal countermeasure using game theory is proposed. Based on the signal game theory, a multi-stage adversary model for dynamic defense is established. Afterwards, the payoffs of candidate attack-defense strategies are quantified from the viewpoint of attack surface transfer. Then the perfect Bayesian equilibrium is calculated. The inference of attacker type is presented through signal reception and recognition. Finally the countermeasure for selecting optimal defense strategy is designed on the tradeoff between defense cost and benefit for dynamic network. A case study of attack-defense confrontation in small-scale LAN shows that the proposed approach is correct and efficient.
引用
收藏
页码:4157 / 4175
页数:19
相关论文
共 50 条
  • [1] Optimal Timing of Moving Target Defense: A Stackelberg Game Model
    Li, Henger
    Zheng, Zizhan
    MILCOM 2019 - 2019 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM), 2019,
  • [2] Using Dynamic Addressing for a Moving Target Defense
    Groat, Stephen
    Dunlop, Matthew
    Marchany, Randy
    Tront, Joseph
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INFORMATION WARFARE AND SECURITY, 2011, : 84 - 91
  • [3] Optimal Strategy Selection for Moving Target Defense Based on Markov Game
    Lei, Cheng
    Ma, Duo-He
    Zhang, Hong-Qi
    IEEE ACCESS, 2017, 5 : 156 - 169
  • [4] Moving Target Defense for the CloudControl Game
    Hamasaki, Koji
    Hohjo, Hitoshi
    ADVANCES IN INFORMATION AND COMPUTER SECURITY, IWSEC 2021, 2021, 12835 : 241 - 251
  • [5] Optimal strategy selection method for moving target defense based on signaling game
    Jiang L.
    Zhang H.
    Wang J.
    Tongxin Xuebao/Journal on Communications, 2019, 40 (06): : 128 - 137
  • [6] A Signaling Game Model for Moving Target Defense
    Feng, Xiaotao
    Zheng, Zizhan
    Cansever, Derya
    Swami, Ananthram
    Mohapatra, Prasant
    IEEE INFOCOM 2017 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2017,
  • [7] Optimal Timing Selection Approach to Moving Target Defense: A FlipIt Attack-Defense Game Model
    Tan, Jing-lei
    Zhang, Heng-wei
    Zhang, Hong-qi
    Lei, Cheng
    Jin, Hui
    Li, Bo-wen
    Hu, Hao
    SECURITY AND COMMUNICATION NETWORKS, 2020, 2020
  • [8] Optimal strategy selection approach to moving target defense based on Markov robust game
    Tan, Jing-lei
    Lei, Cheng
    Zhang, Hong-qi
    Cheng, Yu-qiao
    COMPUTERS & SECURITY, 2019, 85 : 63 - 76
  • [9] Optimal strategy selection approach of moving target defense based on Markov time game
    Tan J.
    Zhang H.
    Zhang H.
    Jin H.
    Lei C.
    1600, Editorial Board of Journal on Communications (41): : 42 - 52
  • [10] Enforcing Optimal Moving Target Defense Policies
    Zheng, Jianjun
    Namin, Akbar Siami
    2019 IEEE 43RD ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1, 2019, : 753 - 759