Struggling with misbehaviours in trust systems

V. Carchiolo, A. Longheu, M. Malgeri, G. Mangioni
{"title":"Struggling with misbehaviours in trust systems","authors":"V. Carchiolo, A. Longheu, M. Malgeri, G. Mangioni","doi":"10.1109/IIT.2009.5413765","DOIUrl":null,"url":null,"abstract":"The growing of networks and the success of fully distributed mechanisms and protocols to exchange data - as peer-to-peer networks - emphasise the need of trustworthiness. Usually both trust and reputation are taken into account: the former expresses the direct experience, whereas the latter represents the common opinion of the whole network. Their applicability and usefulness however could become uncertain when some node of the network is fraudulent, i.e. reports false opinion in order to enhance/reduce the reputation of someone else. In this paper we argue an algorithm - that takes inspiration from the secure Eigen-Trust - aiming at reducing the impact of such fraudulent nodes. We report some preliminary results of simulations performed on Advogato and SqueakFoundation datasets.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIT.2009.5413765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The growing of networks and the success of fully distributed mechanisms and protocols to exchange data - as peer-to-peer networks - emphasise the need of trustworthiness. Usually both trust and reputation are taken into account: the former expresses the direct experience, whereas the latter represents the common opinion of the whole network. Their applicability and usefulness however could become uncertain when some node of the network is fraudulent, i.e. reports false opinion in order to enhance/reduce the reputation of someone else. In this paper we argue an algorithm - that takes inspiration from the secure Eigen-Trust - aiming at reducing the impact of such fraudulent nodes. We report some preliminary results of simulations performed on Advogato and SqueakFoundation datasets.
与信任系统中的不当行为作斗争
网络的发展和完全分布式机制和数据交换协议的成功——作为点对点网络——强调了可信度的必要性。通常,信任和声誉都被考虑在内:前者表达了直接的经验,而后者代表了整个网络的共同意见。然而,当网络的某些节点是欺诈性的,即为了提高/降低其他人的声誉而报告错误的意见时,它们的适用性和有用性可能会变得不确定。在本文中,我们提出了一种算法——从安全的Eigen-Trust中获得灵感——旨在减少此类欺诈性节点的影响。我们报告了在Advogato和SqueakFoundation数据集上进行的一些初步模拟结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信