Privacy, Liveliness and Fairness for Reputation
In various Internet applications, reputation systems are typical means to collect experiences users make with each other. We present a reputation system that balances the security and privacy requirements of all users involed. Our system provides privacy in the form of information theoretic relation...
Saved in:
Published in | SOFSEM 2011: Theory and Practice of Computer Science pp. 506 - 519 |
---|---|
Main Authors | , , |
Format | Book Chapter |
Language | English |
Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
|
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In various Internet applications, reputation systems are typical means to collect experiences users make with each other. We present a reputation system that balances the security and privacy requirements of all users involed. Our system provides privacy in the form of information theoretic relationship anonymity w.r.t. users and the reputation provider. Furthermore, it preserves liveliness, i.e., all past ratings can influence the current reputation profile of a user. In addition, mutual ratings are forced to be simultaneous and self rating is prevented, which enforces fairness. What is more, without performing mock interactions —even if all users are colluding— users cannot forge ratings. As far as we know, this is the first protocol proposed that fulfills all these properties simultaneously. |
---|---|
Bibliography: | This work was supported by the Integrated Project ICT-2007-216483 PrimeLife on Privacy and Identity Management in Europe for Life. Further, it was supported in part by the Concerted Research Action (GOA) Ambiorics 2005/11 of the Flemish Government and by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy). |
ISBN: | 3642183808 9783642183805 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-642-18381-2_42 |