检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江交通职业技术学院,杭州311112 [2]浙江工商大学信电学院,杭州310018
出 处:《浙江交通职业技术学院学报》2016年第1期43-46,共4页Journal of Zhejiang Institute of Communications
基 金:浙江省教育厅科研基金(Y201327320);浙江省高职高专院校专业带头人专业领军项目(lj2013021)
摘 要:当前国内外对信任模型的研究均基于单向服务的对等网络,且难以抵抗"洗底"攻击。针对当前信任模型中对新加入网络的节点赋予固定的信任值,从而容易遭受"洗底"攻击的特点,提出了动态配置节点初始值的方法。同时,为了提高信任模型在网络存储领域应用的灵活性,提出存储信任值和数据读取信任值的概念,并通过存储偏好因子来调节两种信任值在最终结果中的比重,与其他对等网络存储信任模型相比,本模型配置更灵活,应用的范围更广。模拟实验表明,本模型较经典的Eigen Trust信任模型在大范围的"洗底"攻击下具有更高的交易成功率。At present, most researches on the trust model are based on the one - way service, and it is difficult to resist the "cleaning record" attack. In this paper, according to the problem that being prone to "clean record" attack, we propose a new method to dynamically configure the initial value of the node in order to giving a fixed value of trust in the current trust model. At the same time, in order to improve the flexibility of the trust model in the field of network storage, the concept of storage trust value and data read trust value is proposed, and the specific gravity of two kinds of trust value in the final result is adjusted by memory preference factor. Compared with other peer to peer networks, the model is more flexible and more widely used. Simulation experiments show that the model is more successful than the classical EigenTrust model in resisting "clean record" attacks.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145