Robust reputations for peer-to-peer markets
by Traupman, Jonathan David, Ph.D., UNIVERSITY OF CALIFORNIA, BERKELEY, 2007, 180 pages; 3275631

Abstract:

This thesis investigates on-line reputation systems for peer-to-peer markets and presents a number of systems which increase robustness against attacks on individual reputations while still distinguishing between honest and dishonest user behavior.

The fluidity of identity on-line and the unavailability of practical legal recourse make evaluating trust and risk in on-line markets both vital and difficult. Reputation systems have been proposed as one possible means of building trust among strangers by aggregating the experience of many users, and prove more-or-less effective in peer-to-peer marketplaces like eBay. However, the very attributes that make reputation systems helpful also make them a target for fraud. A good reputation is valuable, so some users may try to circumvent the system to gain a high reputation without effort. We look at two specific ways in which users attack reputation systems in peer-to-peer markets and discuss ways in which the damage can be mitigated.

We first address retaliatory negative feedback, where a user leaves a negative feedback for someone who complained about their behavior. We show that allowing retaliation can result in a reputation system that is incapable of identifying low-quality users and allows cheating to go unpunished. We then present EM-Trust, a system that is better able to estimate true user quality even with high levels of retaliation.

We next look at the issue of sybil attacks, where a single user creates a large collection of identities to increase his own reputation. We show that EigenTrust, a widely discussed algorithm that purports to resist similar collusion attacks, does not work against sybils. We then present Relative Rank, a transformation of EigenTrust that is both sybil resistant and better suited to peer-to-peer marketplaces. Finally, we discuss RAW, a variation of PageRank that offers additional guarantees of sybil-resistance.

We demonstrate that it is possible to design reputation systems that are as effective as existing non-robust ones at discriminating between honest and dishonest user behavior, and considerably less affected by common attacks against these systems.

 
AdviserJ. D. Tygar
SchoolUNIVERSITY OF CALIFORNIA, BERKELEY
SourceDAI/B 68-08, p. , Nov 2007
Source TypeDissertation
SubjectsArtificial intelligence; Computer science
Publication Number3275631
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3275631
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.