skip to main content
10.1145/2695664.2695892acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

A reputation system supporting unlinkable, yet authorized expert ratings

Published:13 April 2015Publication History

ABSTRACT

Reputation systems used in practice typically either provide robustness or anonymity. A lot of research has been going on to come up with schemes that provide both properties, however most of them being too impractical. We come up with an approach for a reputation system that provides anonymity for users, meaning that ratings cannot be linked to raters, but at the same time a rater's identity can be disclosed in case a service is rated twice by a user---having the permission to perform only a single rating. This is achieved by making use of a group signature variant, whose properties are described in detail as well. Moreover, we aim to make our system "lively" by introducing the concept of expert raters, which shall constitute an incentive for users to actively participate in the reputation system by providing ratings. We believe that this functionality is an important one towards practicability.

References

  1. Masayuki Abe and Eiichiro Fujisaki. How to date blind signatures. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology (ASIACRYPT '96), volume 1163 of Lecture Notes in Computer Science, pages 244--251. Springer Berlin Heidelberg, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Elli Androulaki, Seung Geol Choi, Steven M. Bellovin, and Tal Malkin. Reputation systems for anonymous networks. In Proceedings of the 8th International Symposium on Privacy Enhancing Technologies, PETS '08, pages 202--218, Berlin, Heidelberg, 2008. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Dan Boneh and Hovav Shacham. Group signatures with verifier-local revocation. In Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS '04, pages 168--177, New York, NY, USA, 2004. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Stefan Brands. Untraceable off-line cash in wallets with observers (extended abstract). In Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO '93, pages 302--318, London, UK, UK, 1994. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. David Chaum, Amos Fiat, and Moni Naor. Untraceable electronic cash. In Shafi Goldwasser, editor, Advances in Cryptology (Crypto '88), volume 403 of Lecture Notes in Computer Science, pages 319--327. Springer New York, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. David Chaum and Eugéne van Heyst. Group signatures. In Donald W. Davies, editor, Advances in Cryptology (EUROCRYPT '91), volume 547 of Lecture Notes in Computer Science, pages 257--265. Springer Berlin Heidelberg, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H. Chien, J. Jan, and Y. Tseng. RSA-based partially blind signature with low computation. In Proceedings of the Eighth International Conference on Parallel and Distributed Systems, ICPADS '01, pages 385--, Washington, DC, USA, 2001. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ivan Damgård, Kasper Dupont, and Michael Østergaard Pedersen. Unclonable group identification. In Serge Vaudenay, editor, Advances in Cryptology - EUROCRYPT 2006, volume 4004 of Lecture Notes in Computer Science, pages 555--572. Springer Berlin Heidelberg, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Uriel Feige, Amos Fiat, and Adi Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1(2):77--94, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Eiichiro Fujisaki and Koutarou Suzuki. Traceable ring signature. In Proceedings of the 10th International Conference on Practice and Theory in Public-key Cryptography, PKC'07, pages 181--200, Berlin, Heidelberg, 2007. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Kevin Hoffman, David Zage, and Cristina Nita-Rotaru. A survey of attack and defense techniques for reputation systems. ACM Comput. Surv., 42(1):1:1--1:31, December 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Alexander Jungmann, Sonja Brangewitz, Ronald Petrlic, and Marie Christin Platenius. Incorporating reputation information into decision-making processes for markets of composed services. International Journal On Advances in Intelligent Systems, 7(4), 2014.Google ScholarGoogle Scholar
  13. Florian Kerschbaum. A verifiable, centralized, coercion-free reputation system. In Proceedings of the 8th ACM workshop on Privacy in the electronic society, WPES '09, pages 61--70, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Ronald Petrlic, Sascha Lutters, and Christoph Sorge. Privacy-preserving reputation management. In Symposium on Applied Computing, SAC 2014, Gyeongju, Republic of Korea - March 24-28, 2014, pages 1712--1718, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Stefan Schiffner, Sebastian Clauß, and Sandra Steinbrecher. Privacy, liveliness and fairness for reputation. In Proceedings of the 37th international conference on Current trends in theory and practice of computer science, SOFSEM'11, pages 506--519, Berlin, Heidelberg, 2011. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A reputation system supporting unlinkable, yet authorized expert ratings

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing
                April 2015
                2418 pages
                ISBN:9781450331968
                DOI:10.1145/2695664

                Copyright © 2015 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 13 April 2015

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article

                Acceptance Rates

                SAC '15 Paper Acceptance Rate291of1,211submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader