Formal Verification of e-Reputation Protocols

Abstract : Reputation systems are often useful in large online communities in which most of the users are unknown to each others. They are good tools to force the users to act in truthfulness way. However, for reputation systems to work effectively users have to be willing to provide rates. In order to incentivize the users to provide honest rates, a reputation system have to ensure their privacy and anonymity. In the other hand, users are also concerned about verifying the correctness of the reputation score. In the applied pi-calculus, we define a formal framework and several fundamental privacy, authentication, and verifiability properties suitable for the security analysis of e-reputation protocols. As proof of concept, using ProVerif, we analyze a simple additive decentralized reputation protocol proposed to ensure rate privacy if all users are honest.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : Pascal Lafourcade <>
Submitted on : Thursday, April 5, 2018 - 5:55:54 PM
Last modification on : Friday, March 15, 2019 - 1:14:48 AM


Files produced by the author(s)


  • HAL Id : hal-01759921, version 1



Ali Kassem, Pascal Lafourcade, Yassine Lakhnech. Formal Verification of e-Reputation Protocols. Foundations and Practice of Security - 7th International Symposium, FPS 2014, , Nov 2014, Montréal, Canada. ⟨hal-01759921⟩



Record views


Files downloads