{"ddc":["040"],"page":"1712-1718","file":[{"creator":"florida","file_size":505927,"date_updated":"2018-03-20T07:04:20Z","date_created":"2018-03-20T07:04:20Z","relation":"main_file","content_type":"application/pdf","access_level":"closed","file_name":"384-reputationsystem_01.pdf","file_id":"1391","success":1}],"publication":"Proceedings of the 29th Symposium On Applied Computing (SAC)","type":"conference","date_updated":"2022-01-06T06:59:42Z","doi":"10.1145/2554850.2554881","author":[{"first_name":"Ronald","full_name":"Petrlic, Ronald","last_name":"Petrlic"},{"first_name":"Sascha","last_name":"Lutters","full_name":"Lutters, Sascha"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"abstract":[{"lang":"eng","text":"Reputation systems provide reputation values of rated parties to users. These reputation values, typically aggregations of individual user ratings, shall be reliable, i.e. should enable a realistic assessment of the probability that the rated party behaves as expected in a transaction. In order for the reputation values to stay reliable and, thus, for the reputation system to provide a benefit, the system needs to be resistant against manipulations by users, the rated parties trying to improve their reputation values, and even against competitors trying to worsen a reputation value. At the same time, a reputation system shall provide privacy protection for users: rated parties shall not be able to learn who provided a certain rating. Otherwise users might not take part in the system as they fear bad feedback in revenge for bad ratings, or users do not want to be connected to certain transactions based on their provided ratings. In this paper we come up with a solution that provides both, reliability of reputation values on the one hand, and privacy protection for users on the other hand. In contrast to related work, our solution only makes use of a single reputation provider that needs to be trusted (to a certain extent) and does not require any bulletin boards to be present in the system. We make use of the Paillier cryptosystem to provide an aggregation of individual user ratings in a way that no party can learn which user provided a certain rating."}],"has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","year":"2014","citation":{"bibtex":"@inproceedings{Petrlic_Lutters_Sorge_2014, title={Privacy-Preserving Reputation Management}, DOI={10.1145/2554850.2554881}, booktitle={Proceedings of the 29th Symposium On Applied Computing (SAC)}, author={Petrlic, Ronald and Lutters, Sascha and Sorge, Christoph}, year={2014}, pages={1712–1718} }","chicago":"Petrlic, Ronald, Sascha Lutters, and Christoph Sorge. “Privacy-Preserving Reputation Management.” In Proceedings of the 29th Symposium On Applied Computing (SAC), 1712–18, 2014. https://doi.org/10.1145/2554850.2554881.","short":"R. Petrlic, S. Lutters, C. Sorge, in: Proceedings of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–1718.","ieee":"R. Petrlic, S. Lutters, and C. Sorge, “Privacy-Preserving Reputation Management,” in Proceedings of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–1718.","mla":"Petrlic, Ronald, et al. “Privacy-Preserving Reputation Management.” Proceedings of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–18, doi:10.1145/2554850.2554881.","ama":"Petrlic R, Lutters S, Sorge C. Privacy-Preserving Reputation Management. In: Proceedings of the 29th Symposium On Applied Computing (SAC). ; 2014:1712-1718. doi:10.1145/2554850.2554881","apa":"Petrlic, R., Lutters, S., & Sorge, C. (2014). Privacy-Preserving Reputation Management. In Proceedings of the 29th Symposium On Applied Computing (SAC) (pp. 1712–1718). https://doi.org/10.1145/2554850.2554881"},"user_id":"15504","date_created":"2017-10-17T12:42:06Z","file_date_updated":"2018-03-20T07:04:20Z","title":"Privacy-Preserving Reputation Management","_id":"384"}