Methods for Computing Trust and Reputation While Preserving Privacy

  • Authors:
  • Ehud Gudes;Nurit Gal-Oz;Alon Grubshtein

  • Affiliations:
  • Dept. of Computer Science and Deutsche Telekom Labs at Ben-Gurion University, Beer-Sheva, Israel 84105;Dept. of Computer Science and Deutsche Telekom Labs at Ben-Gurion University, Beer-Sheva, Israel 84105;Dept. of Computer Science and Deutsche Telekom Labs at Ben-Gurion University, Beer-Sheva, Israel 84105

  • Venue:
  • Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Trust and Reputation systems in distributed environments attain widespread interest as online communities are becoming an inherent part of the daily routine of Internet users. Trust-based models enable safer operation within communities to which information exchange and peer to peer interaction are centric. Several models for trust based reputation have been suggested recently, among them the Knots model [5]. In these models, the subjective reputation of a member is computed using information provided by a set of members trusted by the latter. The present paper discusses the computation of reputation in such models, while preserving members' private information. Three different schemes for the private computation of reputation are presented, and the advantages and disadvantages in terms of privacy and communication overhead are analyzed.