Skip to main content

Privacy, Liveliness and Fairness for Reputation

  • Conference paper
SOFSEM 2011: Theory and Practice of Computer Science (SOFSEM 2011)

Abstract

In various Internet applications, reputation systems are typical means to collect experiences users make with each other. We present a reputation system that balances the security and privacy requirements of all users involed. Our system provides privacy in the form of information theoretic relationship anonymity w.r.t. users and the reputation provider. Furthermore, it preserves liveliness, i.e., all past ratings can influence the current reputation profile of a user. In addition, mutual ratings are forced to be simultaneous and self rating is prevented, which enforces fairness. What is more, without performing mock interactions —even if all users are colluding— users cannot forge ratings. As far as we know, this is the first protocol proposed that fulfills all these properties simultaneously.

This work was supported by the Integrated Project ICT-2007-216483 PrimeLife on Privacy and Identity Management in Europe for Life. Further, it was supported in part by the Concerted Research Action (GOA) Ambiorics 2005/11 of the Flemish Government and by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Resnick, P., Kuwabara, K., Zeckhauser, R., Friedman, E.: Reputation systems. Communications of the ACM 43(12), 45–48 (2000)

    Article  Google Scholar 

  2. Schiffner, S., Clauß, S., Steinbrecher, S.: Privacy and liveliness for reputation systems. In: Martinelli, F., Preneel, B. (eds.) EuroPKI 2009. LNCS, vol. 6391, pp. 209–224. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Camerer, C., Weigelt, K.: Experimental tests of a sequential equilibrium reputation model. Econometrica 56, 1–36 (1988)

    Article  MathSciNet  Google Scholar 

  4. Dasgupta, P.: Trust as a commodity. In: Gambetta, D. (ed.) Trust: Making and Breaking Cooperative Relations, Department of Sociology, pp. 49–72. University Oxford (2000)

    Google Scholar 

  5. Bygrave, L.: Data Protection Law, Approaching Its Rationale, Logic and Limits, p. 448. Kluwer Law International, The Hague (2002)

    Google Scholar 

  6. Mahler, T., Olsen, T.: Reputation systems and data protection law. In: eAdoption and the Knowledge Economy: Issues, Applications, Case Studies, pp. 180–187. IOS Press, Amsterdam (2004)

    Google Scholar 

  7. ENISA: Position paper. reputation-based systems: a security analysis (2007), http://www.enisa.europa.eu/doc/pdf/deliverables/enisa_pp_reputation_based_system.pdf (last visit 16/06/09)

  8. Voss, M.: Privacy preserving online reputation systems. In: International Information Security Workshops, pp. 245–260. Kluwer, Dordrecht (2004)

    Google Scholar 

  9. Mui, L.: Computational Models of Trust and Reputation: Agents, Evolutionary Games, and Social Networks. PhD Thesis, Massachusetts Institute of Technology (2003)

    Google Scholar 

  10. Dellarocas, C.: The digitization of word-of-mouth: Promise and challenges of online feedback mechanisms. Management Science, 1407–1424 (October 2003)

    Google Scholar 

  11. Steinbrecher, S.: Enhancing multilateral security in and by reputation systems. In: Matyáš, V., Fischer-Hübner, S., Cvrček, D., Švenda, P. (eds.) IFIP/FIDIS 9.2, 9.6/11.6, 11.7/FIDIS. IFIP Advances in Information and Communication Technology, vol. 298, pp. 135–150. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Pavlov, E., Rosenschein, J.S., Topol, Z.: Supporting privacy in decentralized additive reputation systems. In: The Second International Conference on Trust Management, Oxford, United Kingdom, pp. 108–119 (March 2004)

    Google Scholar 

  13. Dellarocas, C.: Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior. In: Proceedings of the 2nd ACM conference on Electronic commerce, EC 2000, pp. 150–157. ACM Press, New York (2000)

    Google Scholar 

  14. Androulaki, E., Choi, S.G., Bellovin, S.M., Malkin, T.G.: Reputation systems for anonymous networks. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 202–218. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Steinbrecher, S.: Design options for privacy-respecting reputation systems within centralised internet communities. In: Proceedings of IFIP Sec 2006, 21st IFIP International Information Security Conference: Security and Privacy in Dynamic Environments. IFIP, vol. 201, pp. 123–134. Springer, Heidelberg (2006)

    Google Scholar 

  16. Dellarocas, C.: Research note – how often should reputation mechanisms update a trader’s reputation profile? Information Systems Research 17(3), 271–285 (2006)

    Article  Google Scholar 

  17. Kerschbaum, F.: A verifiable, centralized, coercion-free reputation system. In: Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, WPES 2009, pp. 61–70. ACM, New York (2009)

    Google Scholar 

  18. Steinbrecher, S.: Balancing privacy and trust in electronic marketplaces. In: Katsikas, S.K., López, J., Pernul, G. (eds.) TrustBus 2004. LNCS, vol. 3184, pp. 70–79. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1, 65–75 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  20. Waidner, M., Pfitzmann, B.: The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, p. 690. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  21. Waidner, M.: Unconditional sender and recipient untraceability in spite of active attacks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 302–319. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  22. Pfitzmann, A.: Diensteintegrierende Kommunikationsnetze mit teilnehmerüberprüfbarem Datenschutz. Phd thesis, Universität Karlsruhe, Fakultät für Informatik, Heidelberg (1989)

    Google Scholar 

  23. Stinson, D.R.: Universal hashing and authentication codes. Des. Codes Cryptography 4(4), 369–380 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schiffner, S., Clauß, S., Steinbrecher, S. (2011). Privacy, Liveliness and Fairness for Reputation. In: Černá, I., et al. SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011. Lecture Notes in Computer Science, vol 6543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18381-2_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18380-5

  • Online ISBN: 978-3-642-18381-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics