Decentralized Polling with Respectable Participants

Détails

Ressource 1Télécharger: Guerraoui09OPODIS.pdf (323.02 [Ko])
Etat: Serval
Version: de l'auteur
ID Serval
serval:BIB_72997330202B
Type
Actes de conférence (partie): contribution originale à la littérature scientifique, publiée à l'occasion de conférences scientifiques, dans un ouvrage de compte-rendu (proceedings), ou dans l'édition spéciale d'un journal reconnu (conference proceedings).
Collection
Publications
Titre
Decentralized Polling with Respectable Participants
Titre de la conférence
Proceedings of the 13th International Conference On Principles Of Distributed Systems (OPODIS)
Auteur(s)
Guerraoui R., Huguenin K., Kermarrec A.-M., Monod M.
Editeur
Springer
Adresse
Nîmes, France
ISBN
978-3-642-10876-1
978-3-642-10877-8
ISSN
0302-9743
1611-3349
Statut éditorial
Publié
Date de publication
2009
Peer-reviewed
Oui
Volume
5923
Série
Lecture Notes in Computer Science
Pages
144-158
Langue
anglais
Résumé
We consider the polling problem in a social network where participants care about their reputation: they do not want their vote to be disclosed nor their misbehaving, if any, to be publicly exposed. Assuming this reputation concern, we show that a simple secret sharing scheme, combined with verification procedures, can efficiently enable polling without the need for any central authority or heavyweight cryptography.
More specifically, we present DPol, a simple and scalable distributed polling protocol where misbehaving nodes are exposed with a non-zero probability and the probability of dishonest participants violating privacy is balanced with their impact on the accuracy of the polling result. The trade-off is captured by a generic parameter of the protocol, an integer k we call the privacy parameter, so that in a system of N nodes with B<√N dishonest participants, the probability of disclosing a participant’s vote is bounded by (B/N)^(k+1) , whereas the impact on the polling result is bounded by (6k + 2) B.
We report on the deployment of DPolover 400 PlanetLab nodes. The polling result suffers a relative error of less than 10% in the face of message losses, crashes and asynchrony inherent in PlanetLab. In the presence of dishonest nodes, our experiments show that the impact on the polling result is (4k + 1) B on average, consistently lower that the theoretical bound of (6k + 2) B.
Web of science
Création de la notice
01/12/2016 12:46
Dernière modification de la notice
03/03/2018 18:17
Données d'usage