Research Article

Exploring the feasibility of proactive reputations

  1. Gayatri Swamynathan*,
  2. Ben Y. Zhao,
  3. Kevin C. Almeroth

Article first published online: 1 MAY 2007

DOI: 10.1002/cpe.1186

Issue

Concurrency and Computation: Practice and Experience

Concurrency and Computation: Practice and Experience

Special Issue: Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)

Volume 20, Issue 2, pages 155–166, February 2008

Additional Information

How to Cite

Swamynathan, G., Zhao, B. Y. and Almeroth, K. C. (2008), Exploring the feasibility of proactive reputations. Concurrency Computat.: Pract. Exper., 20: 155–166. doi: 10.1002/cpe.1186

Author Information

  1. 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.

Publication History

  1. Issue published online: 19 DEC 2007
  2. Article first published online: 1 MAY 2007
  3. Manuscript Accepted: 30 JAN 2007
  4. Manuscript Revised: 21 JAN 2007
  5. Manuscript Received: 23 OCT 2006

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (156K)

Keywords:

  • anonymity;
  • entropy;
  • peer-to-peer;
  • reputation;
  • trust

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.

Get PDF (156K)