Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior, Proceedings of the 2nd ACM conference on Electronic commerce , EC '00, 2000. ,
DOI : 10.1145/352871.352889
Robust De-anonymization of Large Sparse Datasets, 2008 IEEE Symposium on Security and Privacy (sp 2008), 2008. ,
DOI : 10.1109/SP.2008.33
Enhancing Multilateral Security in and by Reputation Systems, 2008. ,
DOI : 10.1016/S1389-1286(00)00029-3
Signatures of Reputation, 2010. ,
DOI : 10.1007/978-3-642-14577-3_35
Supporting Privacy in Decentralized Additive Reputation Systems, International Conference on Trust Management, 2004. ,
DOI : 10.1007/978-3-540-24747-0_9
Preserving privacy of feedback providers in decentralized reputation systems, Computers & Security, vol.31, issue.7, 2012. ,
DOI : 10.1016/j.cose.2011.12.003
URL : https://hal.archives-ouvertes.fr/hal-01352961
A verifiable, centralized, coercion-free reputation system, Proceedings of the 8th ACM workshop on Privacy in the electronic society, WPES '09, 2009. ,
DOI : 10.1145/1655188.1655197
k-anonymous reputation, In: Symposium on Information, Computer and Communications SecurityASIACCS, 2013. ,
Reputation Systems for Anonymous Networks, Privacy Enhancing Technologies (PETS), 2008. ,
DOI : 10.1007/978-3-540-70630-4_13
Bad is stronger than good, Review of General Psychology, 2001. ,
Extending signatures of reputation, In: Privacy and Identity. IFIP AICT, pp.421-165, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00997133
Trust among strangers in Internet transactions: Empirical analysis of eBay's reputation system. The Economics of the Internet and E-Commerce, 2002. ,
The beta reputation system, Bled Electronic Commerce Conference, 2002. ,
Distributed Reputation Management for Electronic Commerce, Computational Intelligence, vol.18, issue.4, 2002. ,
DOI : 10.1111/1467-8640.00202
The Eigentrust algorithm for reputation management in P2P networks, Proceedings of the twelfth international conference on World Wide Web , WWW '03, 2003. ,
DOI : 10.1145/775152.775242
Incentive-Based Robust Reputation Mechanism for P2P Services, International Conference on Principles of Distributed Systems (OPODIS), 2006. ,
DOI : 10.1007/11945529_22
URL : https://hal.archives-ouvertes.fr/inria-00121609
A Decentralized Privacy Preserving Reputation Protocol for the Malicious Adversarial Model, IEEE Transactions on Information Forensics and Security, vol.8, issue.6, 2013. ,
DOI : 10.1109/TIFS.2013.2258914
URL : https://hal.archives-ouvertes.fr/hal-01339185
A survey of trust and reputation systems for online service provision, Decision Support Systems, vol.43, issue.2, 2007. ,
DOI : 10.1016/j.dss.2005.05.019
Taxonomy of trust: Categorizing P2P reputation systems, Computer Networks, vol.50, issue.4, 2006. ,
DOI : 10.1016/j.comnet.2005.07.011
A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management, 2010. ,
Filtering out unfair ratings in bayesian reputation systems, In: International Workshop on Trust in Agent Societies, 2004. ,
Tor: The second-generation onion router, USENIX Security Symposium, 2004. ,
A practical scheme for non-interactive verifiable secret sharing, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), 1987. ,
DOI : 10.1109/SFCS.1987.4
Efficient Non-interactive Proof Systems for Bilinear Groups, Eurocrypt, 2008. ,
DOI : 10.1007/978-3-540-78967-3_24
Anonymous Proxy Signatures, Security and Cryptography for Networks (SCN), 2008. ,
DOI : 10.1007/978-3-540-85855-3_14
URL : https://hal.archives-ouvertes.fr/inria-00419153
Structurepreserving signatures and commitments to group elements, In: Advances in Cryptology?CRYPTO, 2010. ,
Efficient distributed privacy-preserving reputation mechanism handling nonmonotonic ratings, 2015. ,
DOI : 10.1007/978-3-319-18491-3_7
URL : https://hal.archives-ouvertes.fr/hal-01104837
Batch Groth???Sahai, Applied Cryptography and Network Security (ACNS), 2010. ,
DOI : 10.1007/978-3-642-13708-2_14
URL : https://hal.archives-ouvertes.fr/inria-00577167
Faster Explicit Formulas for Computing Pairings over Ordinary Curves, In: Eurocrypt, 2011. ,
DOI : 10.1007/978-3-642-20465-4_5
Charm: a framework for rapidly prototyping cryptosystems, Journal of Cryptographic Engineering, vol.38, issue.3, pp.111-128, 2013. ,
DOI : 10.1007/s13389-013-0057-3