{"title":"特征信任信誉管理系统中一种有效的风险规避方案","authors":"Takuya Nishikawa, S. Fujita","doi":"10.1109/IC-NC.2010.28","DOIUrl":null,"url":null,"abstract":"Peer-to-Peer (P2P) systems have attracted considerable attention in recent years, as a key technology to realize scalable, dependable network services. However, because of its high anonymity, P2P systems involve several flaws such as the weakness against malicious attacks by anonymous peers. In this paper, we propose a method to evaluate the trustfulness of each peer by explicitly taking into account the reliability of mutual evaluations. The proposed method is an improvement of the Eigen Trust algorithm proposed by Kamvar et al. which calculates a global trust vector consistent with the observed local trust vectors under the weighted sum in a linear space. The performance of the proposed method is evaluated by simulation. The result of simulations indicates that the proposed method identifies a large subset of reliable peers with sufficiently small number of message transmissions compared with previous schemes including the original Eigen Trust.","PeriodicalId":375145,"journal":{"name":"2010 First International Conference on Networking and Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Effective Risk Avoidance Scheme for the EigenTrust Reputation Management System\",\"authors\":\"Takuya Nishikawa, S. Fujita\",\"doi\":\"10.1109/IC-NC.2010.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Peer-to-Peer (P2P) systems have attracted considerable attention in recent years, as a key technology to realize scalable, dependable network services. However, because of its high anonymity, P2P systems involve several flaws such as the weakness against malicious attacks by anonymous peers. In this paper, we propose a method to evaluate the trustfulness of each peer by explicitly taking into account the reliability of mutual evaluations. The proposed method is an improvement of the Eigen Trust algorithm proposed by Kamvar et al. which calculates a global trust vector consistent with the observed local trust vectors under the weighted sum in a linear space. The performance of the proposed method is evaluated by simulation. The result of simulations indicates that the proposed method identifies a large subset of reliable peers with sufficiently small number of message transmissions compared with previous schemes including the original Eigen Trust.\",\"PeriodicalId\":375145,\"journal\":{\"name\":\"2010 First International Conference on Networking and Computing\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 First International Conference on Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC-NC.2010.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 First International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC-NC.2010.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Effective Risk Avoidance Scheme for the EigenTrust Reputation Management System
Peer-to-Peer (P2P) systems have attracted considerable attention in recent years, as a key technology to realize scalable, dependable network services. However, because of its high anonymity, P2P systems involve several flaws such as the weakness against malicious attacks by anonymous peers. In this paper, we propose a method to evaluate the trustfulness of each peer by explicitly taking into account the reliability of mutual evaluations. The proposed method is an improvement of the Eigen Trust algorithm proposed by Kamvar et al. which calculates a global trust vector consistent with the observed local trust vectors under the weighted sum in a linear space. The performance of the proposed method is evaluated by simulation. The result of simulations indicates that the proposed method identifies a large subset of reliable peers with sufficiently small number of message transmissions compared with previous schemes including the original Eigen Trust.