Schemes for Privately Computing Trust and Reputation - Trust Management IV Access content directly
Conference Papers Year : 2010

Schemes for Privately Computing Trust and Reputation


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. Several models for Trust and Reputation have been suggested recently, among them the Knots model [8]. The Knots model provides a member of a community with a method to compute the reputation of other community members. Reputation in this model is subjective and tailored to the taste and choices of the computing member and those members that have similar views, i.e. the computing member's Trust-Set. A discussion on privately computing trust in the Knots model appears in [16]. The present paper extends and improves [16] by presenting three efficient and private protocols to compute trust in trust based reputation systems that use any trust-sets based model. The protocols in the paper are rigorously proved to be private against a semi-honest adversary given standard assumptions on the existence of an homomorphic, semantically secure, public key encryption system. The protocols are analyzed and compared in terms of their privacy characteristics and communication complexity.
Fichier principal
Vignette du fichier
Gal-OzGG10.pdf (230.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01061315 , version 1 (24-11-2017)





Nurit Gal-Oz, Niv Gilboa, Ehud Gudes. Schemes for Privately Computing Trust and Reputation. 4th IFIP WG 11.11 International on Trust Management (TM), Jun 2010, Morioka, Japan. pp.1-16, ⟨10.1007/978-3-642-13446-3_1⟩. ⟨hal-01061315⟩
56 View
83 Download



Gmail Facebook X LinkedIn More