z-logo
Premium
Exploring the feasibility of proactive reputations
Author(s) -
Swamynathan Gayatri,
Zhao Ben Y.,
Almeroth Kevin C.
Publication year - 2008
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1186
Subject(s) - reputation , collusion , computer security , computer science , term (time) , measure (data warehouse) , metric (unit) , peer to peer , internet privacy , reputation system , business , microeconomics , world wide web , data mining , economics , marketing , political science , law , physics , quantum mechanics
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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom