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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
eBay, http://www.ebay.com/
Amirbekyan, A., Estivill-Castro, V.: A new efficient privacy-preserving scalar product protocol (2007)
Chakraborty, S., Ray, I.: Trustbac: integrating trust relationships into the rbac model for access control in open systems. In: Proceedings of the eleventh ACM symposium on Access control models and technologies (SACMAT 2006), pp. 49–58. ACM, New York (2006)
Gal-Oz, N., Grinshpoun, T., Gudes, E., Meisels, A.: Cross-community reputation: Policies and alternatives (2008)
Gal-Oz, N., Gudes, E., Hendler, D.: A robust and knot-aware trust-based reputation model (2008)
Hsu, J.Y.-J., Lin, K.-J., Chang, T.-H., Ho, C.-J., Huang, H.-S., Jih, W.-R.: Parameter learning of personalized trust models in broker-based distributed trust management. Information Systems Frontiers 8(4), 321–333 (2006)
Josang, A., Ismail, R.: The beta reputation system (2002)
Mui, L., Mohtashemi, M., Halberstadt, A.: A computational model of trust and reputation for e-businesses (2002)
Pavlov, E., Rosenschein, J.S., Topol, Z.: Supporting privacy in decentralized additive reputation systems (2004)
Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing (1991)
Pingel, F., Steinbrecher, S.: Multilateral secure cross-community reputation systems for internet communities (2008)
Resnick, P., Zeckhauser, R.: Trust among strangers in Internet transactions: Empirical analysis of eBay’s reputation system. In: The Economics of the Internet and E-Commerce, pp. 127–157 (2002)
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Steinbrecher, S.: Design options for privacy-respecting reputation systems within centralised internet communities (2006)
Yu, B., Singh, M.: Detecting deception in reputation management (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Gudes, E., Gal-Oz, N., Grubshtein, A. (2009). Methods for Computing Trust and Reputation While Preserving Privacy. In: Gudes, E., Vaidya, J. (eds) Data and Applications Security XXIII. DBSec 2009. Lecture Notes in Computer Science, vol 5645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03007-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-03007-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03006-2
Online ISBN: 978-3-642-03007-9
eBook Packages: Computer ScienceComputer Science (R0)