Supporting privacy in decentralized additive reputation systems

Elan Pavlov, Jeffrey S. Rosenschein, Zvi Topol

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

63 Scopus citations

Abstract

Previous studies have been suggestive of the fact that reputation ratings may be provided in a strategic manner for reasons of reciprocation and retaliation, and therefore may not properly reflect the trustworthiness of rated parties. It thus appears that supporting privacy of feedback providers could improve the quality of their ratings. We argue that supporting perfect privacy in decentralized reputation systems is impossible, but as an alternative present three probabilistic schemes that support partial privacy. On the basis of these schemes, we offer three protocols that allow ratings to be privately provided with high probability in decentralized additive reputation systems.

Original languageAmerican English
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsStefan Poslad, Theo Dimitrakos, Colli Franzone Colli Franzone
PublisherSpringer Verlag
Pages108-119
Number of pages12
ISBN (Print)3540213120, 9783540213123
DOIs
StatePublished - 2004
Event2nd International Conference on Trust Management, iTrust 2004 - Oxford, United Kingdom
Duration: 29 Mar 20041 Apr 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2995
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Trust Management, iTrust 2004
Country/TerritoryUnited Kingdom
CityOxford
Period29/03/041/04/04

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2004.

Fingerprint

Dive into the research topics of 'Supporting privacy in decentralized additive reputation systems'. Together they form a unique fingerprint.

Cite this