志愿计算中基于贝叶斯定理的信任模型  

Trust Model for Volunteer Computing Based on Bayesian Theorem

作　　者：徐玲 乔建忠[1] 林树宽 祁瑞华 XU Ling;QIAO Jianzhong;LIN Shukuan;QI Ruihua(School of Computer Science and Engineering,Northeastern University,Shenyang 110169,China;School of Software Engineering,Dalian University of Foreign Languages,Dalian,Liaoning 116044,China)

机构地区：[1]东北大学计算机科学与工程学院,沈阳110169 [2]大连外国语大学软件学院,辽宁大连116044

出　　处：《计算机工程》2020年第4期129-134,共6页Computer Engineering

基　　金：国家自然科学基金青年基金项目(61702072);大连外国语大学科研基金(2015XJQN05)。

摘　　要：志愿计算因其开放性、匿名性和动态性得到广泛应用,但同时也对系统的安全性带来挑战.传统认证方式无法满足志愿计算系统的安全性需求,而通过在系统中建立信任机制可以有效解决这一问题.为此,构建一种基于贝叶斯定理的志愿计算系统信任模型VC-trust.依据贝叶斯定理对节点的不确定性行为进行分析预测,根据节点历史交互记录并引入处罚因子和调节函数计算节点信任值,同时利用时间滑动窗口对其进行更新.实验结果表明,在节点行为变化的情况下,VC-trust模型较BTMS模型具有更高的交互成功率.Volunteer computing has been widely used for its openness,anonymity and dynamic features,but it also brings threats to system security.Traditional authentication methods cannot meet security requirements of volunteering computing systems,which can be solved by building the trust mechanism in systems.This paper proposes a trust model named VC-trust based on Bayesian theorem for volunteering computing systems.The uncertain behavior of nodes is analyzed and predicted based on Bayesian theorem.Then the trust values are calculated by introducing the punishment factor and adjustment function according to historical interactions reconds of nodes,and updated by using time sliding windows.Experimental results show that,in the case of node behavior changing,the VC-trust model has higher interaction success rate compared with BTMS model.

关 键 词：志愿计算 不确定性 信任 时间滑动窗口 贝叶斯定理 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]