Extending Signatures of Reputation

  • Emmanuelle Anceaume
  • Gilles Guette
  • Paul Lajoie-Mazenc
  • Thomas Sirvent
  • Valérie Viet Triem Tong
Conference paper
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 421)


Reputation mechanisms are a powerful tool to reduce the potential risk of interacting with almost or completely unknown users in environments in which there is no incentive to behave trustworthily, e.g. in open and large-scale systems. However, by collecting feedback about users, reputation mechanisms can easily be manipulated to deduce users’ profiles; thus, these mechanisms jeopardize users’ privacy, which clearly compromise their wide adoption. Privacy-preserving reputation mechanisms have recently been proposed to solve this issue. All the proposed designs either rely on a trusted central authority to handle the casting of votes and the derivation of reputation scores, or are based on a distributed environment and use cryptographic tools (e.g. non-interactive zero-knowledge proofs of knowledge and homomorphic encryption) to demonstrate the validity of votes and reputation scores. However, to the best of our knowledge, all the proposed distributed mechanisms produce solely monotonic reputation scores: whatever the outcome of an interaction, a service provider’s reputation can never decrease. In this article, we propose a distributed privacy-preserving reputation mechanism handling both positive and negative votes. This is achieved by combining algorithms and tools from both the distributed and the cryptographic communities.


Distributed reputation mechanism privacy non-monotonic reputation score 


  1. 1.
    Jøsang, A., Ismail, R.: The beta reputation system. In: Proceedings of the 15th Bled Electronic Commerce Conference, pp. 41–55 (2002)Google Scholar
  2. 2.
    Yu, B., Singh, M.P.: Distributed reputation management for electronic commerce. Computational Intelligence 18, 535–549 (2002)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Anceaume, E., Ravoaja, A.: Incentive-based robust reputation mechanism for p2p services. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 305–319. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Anceaume, E., Guette, G., Lajoie-Mazenc, P., Prigent, N.: Viet Triem Tong, V.: A privacy preserving distributed reputation mechanism. In: Proceedings of the IEEE International Conference on Communications (ICC) (2013)Google Scholar
  5. 5.
    Bethencourt, J., Shi, E., Song, D.: Signatures of reputation. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 400–407. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Steinbrecher, S.: Enhancing multilateral security in and by reputation systems. In: Matyáš, V., Fischer-Hübner, S., Cvrček, D., Švenda, P. (eds.) The Future of Identity. IFIP AICT, vol. 298, pp. 135–150. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Pfitzmann, A., Hansen, M.: A terminology for talking about privacy by data minimization, v0.34 (2010)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Resnick, P., Zeckhauser, R.: Trust among strangers in internet transactions: Empirical analysis of ebay’s reputation system. Advances in Applied Microeconomics 11, 127–157 (2002)CrossRefGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415–432. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: The second-generation onion router. In: USENIX Security Symposium, pp. 303–320. USENIX (2004)Google Scholar
  13. 13.
    Fuchsbauer, G., Pointcheval, D.: Anonymous proxy signatures. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 201–217. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS, pp. 427–437. IEEE Computer Society (1987)Google Scholar
  15. 15.
    National Institute of Standards and Technology: Secure hash standard (SHS). Technical Report FIPS 180-4 (2011)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2014

Authors and Affiliations

  • Emmanuelle Anceaume
    • 1
  • Gilles Guette
    • 1
  • Paul Lajoie-Mazenc
    • 1
  • Thomas Sirvent
    • 2
  • Valérie Viet Triem Tong
    • 3
  1. 1.IRISA - Université de Rennes 1 - CNRSFrance
  2. 2.DGA Maîtrise de l’informationIRMAR - Université de Rennes 1France
  3. 3.SUPELECFrance

Personalised recommendations