{"title":"点对点网络的去中心化信任管理","authors":"T. Repantis, V. Kalogeraki","doi":"10.1145/1169075.1169081","DOIUrl":null,"url":null,"abstract":"Modern mobile devices can form ad-hoc networks to autonomously share data and services. While such self-organizing, peer-to-peer communities offer exciting collaboration opportunities, deciding whether to trust another peer can be challenging. In this work we propose a decentralized trust management middleware for ad-hoc, peer-to-peer networks, based on reputation. Our middleware's protocols take advantage of the unstructured nature of the network to render malicious behavior, such as lying and colluding, risky. The reputation information of each peer is stored in its neighbors and piggy-backed on its replies. By simulating the behavior of networks both with and without a rating scheme we were able to show that just a few dishonest peers can flood the network with false results, whereas this phenomenon is virtually eliminated when using our middleware.","PeriodicalId":364168,"journal":{"name":"workshop on Middleware for Pervasive and Ad-hoc Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"66","resultStr":"{\"title\":\"Decentralized trust management for ad-hoc peer-to-peer networks\",\"authors\":\"T. Repantis, V. Kalogeraki\",\"doi\":\"10.1145/1169075.1169081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Modern mobile devices can form ad-hoc networks to autonomously share data and services. While such self-organizing, peer-to-peer communities offer exciting collaboration opportunities, deciding whether to trust another peer can be challenging. In this work we propose a decentralized trust management middleware for ad-hoc, peer-to-peer networks, based on reputation. Our middleware's protocols take advantage of the unstructured nature of the network to render malicious behavior, such as lying and colluding, risky. The reputation information of each peer is stored in its neighbors and piggy-backed on its replies. By simulating the behavior of networks both with and without a rating scheme we were able to show that just a few dishonest peers can flood the network with false results, whereas this phenomenon is virtually eliminated when using our middleware.\",\"PeriodicalId\":364168,\"journal\":{\"name\":\"workshop on Middleware for Pervasive and Ad-hoc Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"66\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"workshop on Middleware for Pervasive and Ad-hoc Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1169075.1169081\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"workshop on Middleware for Pervasive and Ad-hoc Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1169075.1169081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Decentralized trust management for ad-hoc peer-to-peer networks
Modern mobile devices can form ad-hoc networks to autonomously share data and services. While such self-organizing, peer-to-peer communities offer exciting collaboration opportunities, deciding whether to trust another peer can be challenging. In this work we propose a decentralized trust management middleware for ad-hoc, peer-to-peer networks, based on reputation. Our middleware's protocols take advantage of the unstructured nature of the network to render malicious behavior, such as lying and colluding, risky. The reputation information of each peer is stored in its neighbors and piggy-backed on its replies. By simulating the behavior of networks both with and without a rating scheme we were able to show that just a few dishonest peers can flood the network with false results, whereas this phenomenon is virtually eliminated when using our middleware.