Journal ArticleDOI
PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities
Reads0
Chats0
TLDR
PeerTrust is presented - a reputation-based trust supporting framework, which includes a coherent adaptive trust model for quantifying and comparing the trustworthiness of peers based on a transaction-based feedback system, and a decentralized implementation of such a model over a structured P2P network.Abstract:
Peer-to-peer (P2P) online communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such communities is to use community-based reputations to help estimate the trustworthiness of peers. We present PeerTrust - a reputation-based trust supporting framework, which includes a coherent adaptive trust model for quantifying and comparing the trustworthiness of peers based on a transaction-based feedback system, and a decentralized implementation of such a model over a structured P2P network. PeerTrust model has two main features. First, we introduce three basic trust parameters and two adaptive factors in computing trustworthiness of peers, namely, feedback a peer receives from other peers, the total number of transactions a peer performs, the credibility of the feedback sources, transaction context factor, and the community context factor. Second, we define a general trust metric to combine these parameters. Other contributions of the paper include strategies used for implementing the trust model in a decentralized P2P environment, evaluation mechanisms to validate the effectiveness and cost of PeerTrust model, and a set of experiments that show the feasibility and benefit of our approach.read more
Citations
More filters
Journal ArticleDOI
Security, privacy and trust in Internet of Things
TL;DR: In this article, the authors present the main research challenges and the existing solutions in the field of IoT security, identifying open issues and suggesting some hints for future research, and suggest some hints to future research.
Posted Content
Predicting Positive and Negative Links in Online Social Networks
TL;DR: In this article, the authors study online social networks in which relationships can be either positive (indicating relations such as friendship) or negative (ending up with opposition or antagonism) and find that the signs of links in the underlying social networks can be predicted with high accuracy, using models that generalize across this diverse range of sites.
Proceedings ArticleDOI
Predicting positive and negative links in online social networks
TL;DR: These models provide insight into some of the fundamental principles that drive the formation of signed links in networks, shedding light on theories of balance and status from social psychology and suggest social computing applications by which the attitude of one user toward another can be estimated from evidence provided by their relationships with other members of the surrounding social network.
Journal ArticleDOI
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Runfang Zhou,Kai Hwang +1 more
TL;DR: A new fair scheduling technique, called OCGRR (output controlled grant-based round robin), for the support of DiffServ traffic in a core router, which reduces the intertransmission time from the same stream and achieves a smaller jitter and startup latency.
Journal ArticleDOI
A survey of trust in social networks
TL;DR: This article presents the first comprehensive review of social and computer science literature on trust in social networks and discusses recent works addressing three aspects of social trust: trust information collection, trust evaluation, and trust dissemination.
References
More filters
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Book ChapterDOI
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Proceedings ArticleDOI
A scalable content-addressable network
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Proceedings ArticleDOI
The Eigentrust algorithm for reputation management in P2P networks
TL;DR: An algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads is described.
Journal ArticleDOI
Reputation and imperfect information
David M. Kreps,Robert Wilson +1 more
TL;DR: The authors reexamine Selten's model, adding to it a small amount of imperfect (or incomplete) information about players' payoffs, and find that this addition is sufficient to give rise to the reputation effect that one intuitively expects.