Exploring the feasibility of proactive reputations: Research Articles

Authors:
Gayatri Swamynathan;Ben Y. Zhao;Kevin C. Almeroth
Affiliations:
Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA 93106, U.S.A.;Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA 93106, U.S.A.;Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA 93106, U.S.A.
Venue:
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
Year:
2008

Citing 0
Cited 6

Exploring the Feasibility of Reputation Models for Improving P2P Routing under Churn

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Exploring the feasibility of reputation systems under churn

IEEE Communications Letters
Design issues for Peer-to-Peer Massively Multiplayer Online Games

International Journal of Advanced Media and Communication
The design of a reliable reputation system

Electronic Commerce Research
Understanding the effects of P2P dynamics on trust bootstrapping

Information Sciences: an International Journal
Peer-to-peer architectures for massively multiplayer online games: A Survey

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reputation mechanisms help peers in a peer-to-peer system avoid unreliable or malicious peers. In application-level networks, however, short peer lifetimes mean reputations are often generated from a small number of past transactions. These reputation values are less ‘reliable’, and more vulnerable to bad-mouthing or collusion attacks. We address this issue by introducing proactive reputations, a first-hand history of transactions initiated to augment incomplete or short-term reputation values. We present several mechanisms to generate proactive reputations, along with a statistical similarity metric to measure their effectiveness. Copyright © 2007 John Wiley & Sons, Ltd.