Due to the open, anonymous nature of many P2P networks, new identities -or sybils -may be created cheaply and in large numbers. Given a reputation system, a peer may attempt to falsely raise its reputation by creating fake links between its sybils. Many existing reputation mechanisms are not resistant to these types of strategies. Using a static graph formulation of reputation, we attempt to formalize the notion of sybilproofness. We show that there is no symmetric sybilproof reputation function. For nonsymmetric reputations, following the notion of reputation propagation along paths, we give a general asymmetric reputation function based on flow and give conditions for sybilproofness.
REF , formalize the notion of sybilproofness in reputation schemes.
Sybilproof reputation mechanisms
P2PECON '05
Computer Science