%0 Book Section
%T Extending Signatures of Reputation
%+ CIDER
%+ Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE)
%+ SUPELEC-Campus Rennes
%+ Institut de Recherche Mathématique de Rennes (IRMAR)
%A Anceaume, Emmanuelle
%A Guette, Gilles
%A Lajoie-Mazenc, Paul
%A Sirvent, Thomas
%A Viet Triem Tong, Valérie
%Z Part 3: Preserving Privacy
%@ 978-3-642-55136-9
%B Privacy and Identity Management for Emerging Services and Technologies : 8th IFIP WG 9.2, 9.5, 9.6/11.7, 11.4, 11.6 International Summer School, Nijmegen, The Netherlands, June 17-21, 2013, Revised Selected Papers
%E Hansen, M.
%E Hoepman, J.-H.
%E Leenes, R.
%E Whitehouse, D.
%I Springer
%S IFIP Advances in Information and Communication Technology (TUTORIAL)
%V AICT-421
%P 165-176
%8 2014
%D 2014
%R 10.1007/978-3-642-55137-6_13
%Z Computer Science [cs]/Computer Science and Game Theory [cs.GT]
%Z Computer Science [cs]Book sections
%X 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.
%G English
%2 https://hal.science/hal-00997133/document
%2 https://hal.science/hal-00997133/file/sigreppp.pdf
%L hal-00997133
%U https://hal.science/hal-00997133
%~ SUPELEC
%~ INSTITUT-TELECOM
%~ EC-PARIS
%~ UNIV-RENNES1
%~ IRMAR
%~ UR2-HB
%~ CNRS
%~ INRIA
%~ UNIV-UBS
%~ INSA-RENNES
%~ INRIA-RENNES
%~ IRISA
%~ INSMI
%~ IRISA_SET
%~ INRIA_TEST
%~ SUP_CIDRE
%~ UNAM
%~ TESTALAIN1
%~ IRMAR-GAR
%~ IFIP
%~ IFIP-AICT
%~ CHL
%~ IRISA-D1
%~ INRIA2
%~ IFIP-TC
%~ IFIP-AICT-421
%~ IFIP-WG
%~ IFIP-AICT-TUTORIAL
%~ IFIP-TC9
%~ IFIP-TC11
%~ IFIP-WG9-2
%~ IFIP-WG9-5
%~ IFIP-WG9-6
%~ IFIP-WG11-7
%~ IFIP-WG11-4
%~ IFIP-WG11-6
%~ UR1-HAL
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ AGREENIUM
%~ UNIV-RENNES2
%~ IFIP-2010
%~ TEST-UNIV-RENNES
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ INSA-GROUPE
%~ INSTITUTS-TELECOM
%~ ANR
%~ UR1-MATH-NUM
%~ INSTITUT-AGRO