A Maximum Independent Set Approach for Collusion Detection in Voting Pools

Abstract : From agreement problems to replicated software execution, we frequently find scenarios with voting pools. Unfortunately, Byzantine adversaries can join and collude to distort the results of an election. We address the problem of detecting these colluders, in scenarios where they repeatedly participate in voting decisions. We investigate different malicious strategies, such as naive or colluding attacks, with fixed identifiers or in whitewashing attacks. Using a graph-theoretic approach, we frame collusion detection as a problem of identifying maximum independent sets. We then propose several new graph- based methods and show, via analysis and simulations, their effectiveness and practical applicability for collusion detection.
Type de document :
Article dans une revue
Journal of Parallel and Distributed Computing, Elsevier, 2011, 71 (10), pp.1356-1366. 〈10.1016/j.jpdc.2011.06.004〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00788764
Contributeur : Arnaud Legrand <>
Soumis le : vendredi 15 février 2013 - 11:09:50
Dernière modification le : jeudi 11 octobre 2018 - 08:48:02

Lien texte intégral

Identifiants

Collections

Citation

F. Araujo, J. Farinha, Patricio Domingues, G. C. Silaghi, Derrick Kondo. A Maximum Independent Set Approach for Collusion Detection in Voting Pools. Journal of Parallel and Distributed Computing, Elsevier, 2011, 71 (10), pp.1356-1366. 〈10.1016/j.jpdc.2011.06.004〉. 〈hal-00788764〉

Partager

Métriques

Consultations de la notice

198