Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Exploring the Feasibility of Proactive Reputations Gayatri Swamynathan, Ben Y. Zhao and Kevin C. Almeroth
 

Summary: Exploring the Feasibility of Proactive Reputations
Gayatri Swamynathan, Ben Y. Zhao and Kevin C. Almeroth
Department of Computer Science, UC Santa Barbara
{gayatri, ravenben, almeroth}@cs.ucsb.edu
ABSTRACT
Reputation mechanisms help peers in a peer-to-peer (P2P) system
avoid unreliable or malicious peers. In application-level networks,
however, short peer life-times mean reputations are often gener-
ated 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 for generating proactive reputations, along with a sta-
tistical similarity metric to measure their effectiveness.
1. INTRODUCTION
The growing success of peer-to-peer(P2P)networks makes
securing them an increasingly difficult research challenge.
Popular P2P applications can support millions of users spread
acrossnumerousadministrativeandnetworkboundaries. The

  

Source: Almeroth, Kevin C. - Department of Computer Science, University of California at Santa Barbara
Zhao, Ben Y. - Department of Computer Science, University of California at Santa Barbara

 

Collections: Computer Technologies and Information Sciences