当前位置: X-MOL 学术Cluster Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The optimal privacy strategy of cloud service based on evolutionary game
Cluster Computing ( IF 4.4 ) Pub Date : 2020-08-08 , DOI: 10.1007/s10586-020-03164-5
Pan Jun Sun

Cloud service has great convenience, because of its complex structure and dynamic nature, it is difficult to choose the best cost-effective strategy in the process of security and privacy information. To solve this problem, we construct a quantitative benefit of game strategy, use evolutionary game theory to build a game model of attack protection, propose the optimal protection strategy selection algorithm, and make the stable equilibrium solution based on limited rational constraints. Because of the inter dependency among the strategies in the same game group, we use the incentive coefficient to improve the classical dynamic replication equation, establish an improved attack protection evolutionary game model, further discuss and analyze the stability of the equilibrium point based on Jacobian matrix method, and give the optimal selection strategy under different conditions. Finally, we show the correctness, credibility, and effectiveness of the model through experiments; different strategies of the same group have the dual effects of promotion and inhibition, and show the characteristics and advantages of this paper by comparing with other literatures.



中文翻译:

基于进化博弈的云服务最优隐私策略

云服务具有极大的便利性,由于其复杂的结构和动态的性质,很难在安全性和隐私信息处理过程中选择最佳的成本效益策略。为了解决这个问题,我们建立了定量的博弈策略收益,运用进化博弈论建立了攻击防御博弈模型,提出了最优的保护策略选择算法,并基于有限的有理约束条件给出了稳定的均衡解。由于同一博弈组中策略之间的相互依赖关系,我们使用激励系数来改进经典的动态复制方程,建立改进的攻击保护进化博弈模型,并进一步讨论和分析基于雅可比矩阵的平衡点的稳定性。方法,并给出不同条件下的最优选择策略。最后,我们通过实验证明了该模型的正确性,可信性和有效性。同一组的不同策略具有促进和抑制的双重作用,并且通过与其他文献进行比较来显示本文的特点和优势。

更新日期:2020-08-09
down
wechat
bug