信息工程大学学报2024，Vol.25Issue(2)：205-212,8.DOI:10.3969/j.issn.1671-0673.2024.02.012
基于演化博弈的Serverless移动目标防御决策方法
Moving Target Defense Decision Method Based on Evolutionary Game in Serverless Computing
摘要
Abstract
Serverless is a new computing paradigm with lightweight and agile characteristics,due to the particularity of its architecture,some new security threats are introduced on the basis of the origi-nal cloud security issues.To address the problem that it is difficult to accurately select the optimal defense strategy in unknown offensive and defensive scenarios,a defense strategy is proposed based on the diversified ideas of MTD from the aspects of virtualization layer and application layer.The Q-Learning algorithm with Boltzmann exploration is combined with the replication dynamic equation to construct an evolutionary game model with an exploration mechanism from the perspective of bound-ed rationality.Defenders can continuously carry out trial and error,exploration,implementation in repeated offensive and defensive confrontations,and finally obtain the optimal defense strategy and the maximum benefit.Experiments show that the evolutionary game model introducing the exploration mechanism is predictable and has strong stability at the equilibrium point of the evolutionary game.关键词
无服务器/移动目标防御/演化博弈/Q-Learning复制动态方程Key words
Serverless/moving target defense/evolutionary game/Q-Learning replication dynamic equation分类
信息技术与安全科学引用本文复制引用
刘轩宇,张帅..基于演化博弈的Serverless移动目标防御决策方法[J].信息工程大学学报,2024,25(2):205-212,8.基金项目
国家自然科学基金资助项目(62072467) （62072467）
国家重点研发计划资助项目(2021YFB1006200,2021YFB1006201) （2021YFB1006200,2021YFB1006201）
