Efficient Privacy Preserving Reputation Protocols Inspired by Secure Sum

Omar Hasan 1 Elisa Bertino Lionel Brunie 1
1 DRIM - Distribution, Recherche d'Information et Mobilité
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : The secure sum protocol is a well-known protocol for computing the sum of private inputs from distributed entities such that the inputs remain private. In this paper we present protocols for computing reputation in a privacy preserving manner that are inspired by the secure sum protocol. We provide a protocol that is secure under the semi-honest adversarial model as well as one that is secure under the stronger non-disruptive malicious model. Although the protocols are inspired by secure sum, they do not suffer from the issues that plague secure sum. Our protocols are resilient against colluding entities, which secure sum is not. The protocols that we develop are also efficient. We require an exchange of O(n) messages under the semi-honest model, where n is the number of feedback providers in the protocol. This is the same complexity offered by secure sum. Our protocol for the non-disruptive malicious model exchanges O(N log n) messages, where N is the number of entities in the system.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01381565
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Friday, October 14, 2016 - 2:49:02 PM
Last modification on : Friday, January 11, 2019 - 4:34:16 PM

Links full text

Identifiers

Citation

Omar Hasan, Elisa Bertino, Lionel Brunie. Efficient Privacy Preserving Reputation Protocols Inspired by Secure Sum. The 8th International Conference on Privacy, Security and Trust (PST 2010), Aug 2010, Ottawa, Canada. pp.126-133, ⟨10.1109/PST.2010.5593245⟩. ⟨hal-01381565⟩

Share

Metrics

Record views

134