电子学报2018，Vol.46Issue(1)：82-89,8.DOI:10.3969/j.issn.0372-2112.2018.01.012
基于不完全信息动态博弈的动态目标防御最优策略选取研究
Research on Optimal Selection of Moving Target Defense Policy Based on Dynamic Game with Incomplete Information
摘要
Abstract
This paper is focused on the optimal policy selection for moving target defense.Attack-defense confronta tion in moving target defense environment is analyzed.Reward quantization method of moving target defense policy is proposed.Single-stage and multi-stage moving target defense game models are constructed based on the dynamic game with incomplete information.The algorithm to obtain perfect Bayesian equilibrium and the method to revise prior belief are proposed.Optimal moving target defense policies are obtained under different security situations.Finally,not only the feasibility and effectiveness of the proposed model and method are illustrated and verified in a representative example but also general rules of network defense using moving target defense policies are summarized.关键词
动态目标防御/策略选取/不完全信息动态博弈/精炼贝叶斯均衡Key words
moving target defense/policy selection/dynamic game with incomplete information/perfect Bayesian equilibrium分类
信息技术与安全科学引用本文复制引用
刘江,张红旗,刘艺..基于不完全信息动态博弈的动态目标防御最优策略选取研究[J].电子学报,2018,46(1):82-89,8.基金项目
国家863高技术研究发展计划(No.2012AA012704) （No.2012AA012704）
郑州市科技领军人才基金(No.131PLJRC644) （No.131PLJRC644）
