Improvements on Trust Transitivity Model for Open Network

Zhang Lin, Wang Ruchuan, W. Haiyan
{"title":"Improvements on Trust Transitivity Model for Open Network","authors":"Zhang Lin, Wang Ruchuan, W. Haiyan","doi":"10.1109/NCIS.2011.146","DOIUrl":null,"url":null,"abstract":"Traditional security mechanisms have not met with the needs of open network. Trust mechanism will be an important trend in the field of security. Present studies still have some kinds of deficiency. In this paper, Further works are done in trust transitivity model. As an important factor, recommendation ability (\"honesty\") is considered to take part in computing recommendation trust value. Trust storage structures about \"honesty\" and \"accuracy\" are provided, which are based on n history windows and are renewed with time goes on. New trust transitivity tree is studied, which has made differentiation from \"honesty\" and \"accuracy\". Finally, a recursion-arithmetic about trust transitivity is given. Experimentation results show novel trust model is rational, correct and valid.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Network Computing and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCIS.2011.146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Traditional security mechanisms have not met with the needs of open network. Trust mechanism will be an important trend in the field of security. Present studies still have some kinds of deficiency. In this paper, Further works are done in trust transitivity model. As an important factor, recommendation ability ("honesty") is considered to take part in computing recommendation trust value. Trust storage structures about "honesty" and "accuracy" are provided, which are based on n history windows and are renewed with time goes on. New trust transitivity tree is studied, which has made differentiation from "honesty" and "accuracy". Finally, a recursion-arithmetic about trust transitivity is given. Experimentation results show novel trust model is rational, correct and valid.
开放网络信任传递性模型的改进
传统的安全机制已经不能满足开放网络的需求。信任机制将是安全领域的一个重要趋势。目前的研究还存在一些不足。本文对信任传递模型进行了进一步的研究。推荐能力(“诚实度”)作为一个重要因素,被认为参与了推荐信任值的计算。给出了基于n个历史窗口并随时间更新的“诚实”和“准确”信任存储结构。研究了一种新的信任及物树,它区分了“诚实”和“准确”。最后,给出了一个关于信任传递性的递归算法。实验结果表明,该信任模型是合理、正确和有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信