Advertisement

Schemes for Privately Computing Trust and Reputation

  • Nurit Gal-Oz
  • Niv Gilboa
  • Ehud Gudes
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 321)

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. 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.

Keywords

Secret Sharing Scheme Reputation System Homomorphic Encryption Reputation Model Online Phase 
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

  1. 1.
  2. 2.
    Audun, J., Roslan, I., Colin, B.: A survey of trust and reputation systems for online service provision. Decis. Support Syst. 43(2), 618–644 (2007)CrossRefGoogle Scholar
  3. 3.
    Benaloh, J.: Dense probabilstic encryption. In: Proc. of the Workshop on Selected Areas of Cryptography, May 1994, pp. 120–128 (1994)Google Scholar
  4. 4.
    Boneh, D., Goh, E., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005)Google Scholar
  5. 5.
    Chakraborty, S., Ray, I.: Trustbac: integrating trust relationships into the rbac model for access control in open systems. In: Proc. of the eleventh ACM symposium on Access control models and technologies (SACMAT 2006), pp. 49–58. ACM, New York (2006)CrossRefGoogle Scholar
  6. 6.
    Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1–12. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Gal-Oz, N., Grinshpoun, T., Gudes, E., Meisels, A.: Cross-community reputation: Policies and alternatives. In: Proc. of International Conference on Web Based Communities, IADIS - WBC 2008 (2008)Google Scholar
  8. 8.
    Gal-Oz, N., Gudes, E., Hendler, D.: A Robust and Knot-Aware Trust-Based Reputation Model. In: Proceedings of the 2nd Joint iTrust and PST Conferences on Privacy, Trust Management and Security (IFIPTM 2008), Trondheim, Norway, June 2008, vol. 263, pp. 167–182 (2008)Google Scholar
  9. 9.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. of STOC, pp. 169–178 (2009)Google Scholar
  10. 10.
    Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, New York (2000)Google Scholar
  11. 11.
    Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, New York (2004)Google Scholar
  12. 12.
    Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. JACM 33(4), 792–807 (1986)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game (extended abstract). In: STOC 1987, pp. 218–229 (1987)Google Scholar
  14. 14.
    Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and systems science 28, 270–299 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Grinshpoun, T., Gal-Oz, N., Meisels, A., Gudes, E.: Ccr: A model for sharing reputation knowledge across virtual communities. In: Web Intelligence, pp. 34–41 (2009)Google Scholar
  16. 16.
    Gudes, E., Gal-Oz, N., Grubshtein, A.: Methods for computing trust and reputation while preserving privacy. In: Gudes, E., Vaidya, J. (eds.) Data and Applications Security XXIII. LNCS, vol. 5645, pp. 291–298. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    Yung-Jen Hsu, J., Lin, K., Chang, T., Ho, C., Huang, H., Jih, W.: Parameter learning of personalized trust models in broker-based distributed trust management. Information Systems Frontiers 8(4), 321–333 (2006)CrossRefGoogle Scholar
  18. 18.
    Josang, A., Ismail, R.: The beta reputation system. In: proceedings of 15th Bled Electronic Commerce Conference e-Reality: Constructing the e-Economy (June 2002)Google Scholar
  19. 19.
    Mui, L., Mohtashemi, M., Halberstadt, A.: A computational model of trust and reputation for e-businesses. In: Proc. of the 35th Annual Hawaii International Conference on System Sciences (HICSS 2002), Washington, DC, USA, vol. 7, p. 188 (2002)Google Scholar
  20. 20.
    Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Proc. of ACM Conference on Computer and Communications Security, pp. 59–66 (1998)Google Scholar
  21. 21.
    Nin, J., Carminati, B., Ferrari, E., Torra, V.: Computing reputation for collaborative private networks. In: 33rd IEEE Int. COMPSAC conference, pp. 246–253 (2009)Google Scholar
  22. 22.
    Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308–318. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  23. 23.
    Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)Google Scholar
  24. 24.
    Pavlov, E., Rosenschein, J.S., Topol, Z.: Supporting privacy in decentralized additive reputation systems. In: Jensen, C., Poslad, S., Dimitrakos, T. (eds.) iTrust 2004. LNCS, vol. 2995, pp. 108–119. Springer, Heidelberg (2004)Google Scholar
  25. 25.
    Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)Google Scholar
  26. 26.
    Pingel, F., Steinbrecher, S.: Multilateral secure cross-community reputation systems for internet communities. In: Furnell, S.M., Katsikas, S.K., Lioy, A. (eds.) TrustBus 2008. LNCS, vol. 5185, pp. 69–78. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  27. 27.
    Resnick, P., Zeckhauser, R.: Trust among strangers in Internet transactions: Empirical analysis of eBay’s reputation system. In: Baye, M.R. (ed.) The Economics of the Internet and E-Commerce. Advances in Applied Microeconomics, vol. 11, pp. 127–157. Elsevier Science, Amsterdam (2002)CrossRefGoogle Scholar
  28. 28.
    Sabater, J., Sierra, C.: Review on computational trust and reputation models. Artificial Intelligence Review 24(1), 33–60 (2005)zbMATHCrossRefGoogle Scholar
  29. 29.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    Steinbrecher, S.: Design options for privacy-respecting reputation systems within centralised internet communities. In: Proc. of the IFIP TC-11 21st International Information Security Conference (SEC 2006), pp. 123–134 (2006)Google Scholar
  31. 31.
    Xiong, Z., Yang, Y., Zhang, X., Yu, D., Liu, L.: A trust-based reputation system in peer-to-peer grid. In: HCI (15), pp. 228–235 (2007)Google Scholar
  32. 32.
    Yu, B., Singh, M.: Detecting deception in reputation management. In: proceedings of Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 73–80 (2003)Google Scholar
  33. 33.
    Yu, B., Singh, M.P., Sycara, K.: Developing trust in large-scale peer-to-peer systems. In: Proceedings of First IEEE Symposium on Multi-Agent Security and Survivability, pp. 1–10 (2004)Google Scholar

Copyright information

© IFIP 2010

Authors and Affiliations

  • Nurit Gal-Oz
    • 1
  • Niv Gilboa
    • 1
  • Ehud Gudes
    • 1
  1. 1.Dept. of Computer Science and Deutsche Telekom LaboratoriesBen-Gurion UniversityBeer-ShevaIsrael

Personalised recommendations