TY - GEN
T1 - Schemes for privately computing trust and reputation
AU - Oz, Nurit Gal
AU - Gilboa, Niv
AU - Gudes, Ehud
N1 - Publisher Copyright:
© 2010, IFIP International Federation for Information Processing
PY - 2010/1/1
Y1 - 2010/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84943593165
U2 - 10.1007/978-3-642-13446-3_1
DO - 10.1007/978-3-642-13446-3_1
M3 - Conference contribution
AN - SCOPUS:84943593165
SN - 9783642134456
T3 - IFIP Advances in Information and Communication Technology
SP - 1
EP - 16
BT - Trust Management IV - 4th IFIP WG 11.11 International Conference, IFIPTM 2010, Proceedings
A2 - Nishigaki, Masakatsu
A2 - Jøsang, Audun
A2 - Murayama, Yuko
A2 - Marsh, Stephen
PB - Springer New York LLC
T2 - 4th IFIP WG 11.11 International Conference on Trust Management, IFIPTM 2010
Y2 - 16 June 2010 through 18 June 2010
ER -