{"title":"基于节点兴趣相似度的P2P信任模型","authors":"Li Yang, Yu-sen Zhang, Chang-you Xing, Zhang Tao","doi":"10.1109/ICCT.2010.5688911","DOIUrl":null,"url":null,"abstract":"Reputation based trust model is an important way to solve the non-cooperation and malicious behaviors of nodes in P2P networks. Current single trust model hides the behavior details of nodes in different field, thus it cannot defend the strategic attack of malicious nodes. A node Interest Similarity based P2P Trust Model (ISTrust) is proposed, which takes both node interest bias and reputations in each interest domain into consideration, and uses interest domain reputation vector to maintain the behaviors of node in specific interest domain. When calculating reputations of other nodes, ISTrust uses interest similarity between nodes to weight domain local trust recommendation, thus restrains the slandering and exaggeration attacks of malicious nodes, and gives good nodes incentives to provide contribution in many domains. Simulation results show that ISTrust is more efficient and secure than EigenRep.","PeriodicalId":253478,"journal":{"name":"2010 IEEE 12th International Conference on Communication Technology","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A node Interest Similarity based P2P Trust Model\",\"authors\":\"Li Yang, Yu-sen Zhang, Chang-you Xing, Zhang Tao\",\"doi\":\"10.1109/ICCT.2010.5688911\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reputation based trust model is an important way to solve the non-cooperation and malicious behaviors of nodes in P2P networks. Current single trust model hides the behavior details of nodes in different field, thus it cannot defend the strategic attack of malicious nodes. A node Interest Similarity based P2P Trust Model (ISTrust) is proposed, which takes both node interest bias and reputations in each interest domain into consideration, and uses interest domain reputation vector to maintain the behaviors of node in specific interest domain. When calculating reputations of other nodes, ISTrust uses interest similarity between nodes to weight domain local trust recommendation, thus restrains the slandering and exaggeration attacks of malicious nodes, and gives good nodes incentives to provide contribution in many domains. Simulation results show that ISTrust is more efficient and secure than EigenRep.\",\"PeriodicalId\":253478,\"journal\":{\"name\":\"2010 IEEE 12th International Conference on Communication Technology\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 12th International Conference on Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2010.5688911\",\"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 IEEE 12th International Conference on Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2010.5688911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reputation based trust model is an important way to solve the non-cooperation and malicious behaviors of nodes in P2P networks. Current single trust model hides the behavior details of nodes in different field, thus it cannot defend the strategic attack of malicious nodes. A node Interest Similarity based P2P Trust Model (ISTrust) is proposed, which takes both node interest bias and reputations in each interest domain into consideration, and uses interest domain reputation vector to maintain the behaviors of node in specific interest domain. When calculating reputations of other nodes, ISTrust uses interest similarity between nodes to weight domain local trust recommendation, thus restrains the slandering and exaggeration attacks of malicious nodes, and gives good nodes incentives to provide contribution in many domains. Simulation results show that ISTrust is more efficient and secure than EigenRep.