Abstract
Transactions between peers in social networks generate direct reputation (social capital) information. This can be augmented with indirect referrals, on demand or continually, thus giving peers additional information prior to engaging in transactions with others. Despite proposed deterrents such as identity acquisition costs, false referrals through sybil identities pose a significant threat. In this note, we show how a reputation system which multiplicatively chains referrals, and adds referrals from different referral paths/chains, is sybil-proof.
| Original language | English (US) |
|---|---|
| Article number | 5337068 |
| Pages (from-to) | 862-864 |
| Number of pages | 3 |
| Journal | IEEE Communications Letters |
| Volume | 13 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2009 |
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'A sybil-proof referral system based on multiplicative reputation chains'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver