Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10808)

Abstract

We consider reputation systems in the Universal Composability Framework where users can anonymously rate each others products that they purchased previously. To obtain trustworthy, reliable, and honest ratings, users are allowed to rate products only once. Everybody is able to detect users that rate products multiple times. In this paper we present an ideal functionality for such reputation systems and give an efficient realization that is usable in practical applications.

Keywords

Reputation Trust Anonymity Universal Composability 

References

  1. 1.
    Androulaki, E., Choi, S.G., Bellovin, S.M., Malkin, T.: Reputation systems for anonymous networks. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 202–218. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-70630-4_13 CrossRefGoogle Scholar
  2. 2.
    Ateniese, G., Camenisch, J., Hohenberger, S., de Medeiros, B.: Practical group signatures without random oracles. Cryptology ePrint Archive, Report 2005/385 (2005). http://eprint.iacr.org/2005/385
  3. 3.
    Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614–629. Springer, Heidelberg (2003).  https://doi.org/10.1007/3-540-39200-9_38 CrossRefGoogle Scholar
  4. 4.
    Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: the case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136–153. Springer, Heidelberg (2005).  https://doi.org/10.1007/978-3-540-30574-3_11 CrossRefGoogle Scholar
  5. 5.
    Blömer, J., Eidens, F., Juhnke, J.: Practical, anonymous, and publicly linkable universal-composable reputation systems. Cryptology ePrint Archive, Report 2018/029 (2018). http://eprint.iacr.org/2018/029
  6. 6.
    Blömer, J., Juhnke, J., Kolb, C.: Anonymous and publicly linkable reputation systems. In: Böhme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 478–488. Springer, Heidelberg (2015).  https://doi.org/10.1007/978-3-662-47854-7_29 CrossRefGoogle Scholar
  7. 7.
    Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41–55. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-28628-8_3 CrossRefGoogle Scholar
  8. 8.
    Busom, N., Petrlic, R., Sebé, F., Sorge, C., Valls, M.: A privacy-preserving reputation system with user rewards. J. Netw. Comput. Appl. 80, 58–66 (2017)CrossRefGoogle Scholar
  9. 9.
    Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136–145. IEEE Computer Society Press, October 2001Google Scholar
  10. 10.
    Canetti, R.: Universally composable signature, certification, and authentication. In: CSFW-17, p. 219 (2004)Google Scholar
  11. 11.
    Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19–40. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-44647-8_2 CrossRefGoogle Scholar
  12. 12.
    Chase, M., Lysyanskaya, A.: On signatures of knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78–96. Springer, Heidelberg (2006).  https://doi.org/10.1007/11818175_5 CrossRefGoogle Scholar
  13. 13.
    Clauß, S., Schiffner, S., Kerschbaum, F.: \(k\)-anonymous reputation. In: Chen, K., Xie, Q., Qiu, W., Li, N., Tzeng, W.G. (eds.) ASIACCS 13, pp. 359–368. ACM Press, May 2013Google Scholar
  14. 14.
    Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998).  https://doi.org/10.1007/BFb0055717 Google Scholar
  15. 15.
    Damgård, I., David, B., Giacomelli, I., Nielsen, J.B.: Compact VSS and efficient homomorphic UC commitments. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 213–232. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-662-45608-8_12 Google Scholar
  16. 16.
    Damgårg, I.: On \(\sigma \)-protocols (2002). http://www.daimi.au.dk/~ivan/Sigma.ps
  17. 17.
    Dellarocas, C.: Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior. In: EC 2000, pp. 150–157. ACM (2000)Google Scholar
  18. 18.
    Fujisaki, E., Suzuki, K.: Traceable ring signature. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 181–200. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-71677-8_13 CrossRefGoogle Scholar
  19. 19.
    Ghadafi, E., Smart, N.P., Warinschi, B.: Groth–Sahai proofs revisited. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 177–192. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-13013-7_11 CrossRefGoogle Scholar
  20. 20.
    Hasan, O., Brunie, L., Bertino, E., Shang, N.: A decentralized privacy preserving reputation protocol for the malicious adversarial model. IEEE Trans. Inf. Forensics Secur. 8(6), 949–962 (2013)CrossRefGoogle Scholar
  21. 21.
    Hoffman, K., Zage, D., Nita-Rotaru, C.: A survey of attack and defense techniques for reputation systems. ACM Comput. Surv. 42, 1–31 (2009)CrossRefGoogle Scholar
  22. 22.
    Hofheinz, D., Müller-Quade, J.: Universally composable commitments using random oracles. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 58–76. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-24638-1_4 CrossRefGoogle Scholar
  23. 23.
    Kerschbaum, F.: A verifiable, centralized, coercion-free reputation system. In: WPES 2009, pp. 61–70. ACM (2009)Google Scholar
  24. 24.
    Petrlic, R., Lutters, S., Sorge, C.: Privacy-preserving reputation management. In: SAC 2014, pp. 1712–1718. ACM (2014)Google Scholar
  25. 25.
    Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 111–126. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-29485-8_7 CrossRefGoogle Scholar
  26. 26.
    Steinbrecher, S.: Design options for privacy-respecting reputation systems within centralised internet communities. In: Fischer-Hübner, S., Rannenberg, K., Yngström, L., Lindskog, S. (eds.) SEC 2006. IIFIP, vol. 201, pp. 123–134. Springer, Boston, MA (2006).  https://doi.org/10.1007/0-387-33406-8_11 CrossRefGoogle Scholar
  27. 27.
    Zhai, E., Wolinsky, D.I., Chen, R., Syta, E., Teng, C., Ford, B.: Anonrep: towards tracking-resistant anonymous reputation. In: NSDI, pp. 583–596 (2016)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer SciencePaderborn UniversityPaderbornGermany

Personalised recommendations