Skip to Main content Skip to Navigation
New interface
Journal articles

A Maximum Independent Set Approach for Collusion Detection in Voting Pools

F. Araujo J. Farinha Patricio Domingues 1 G. C. Silaghi Derrick Kondo 2 
2 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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.
Complete list of metadata
Contributor : Arnaud Legrand Connect in order to contact the contributor
Submitted on : Friday, February 15, 2013 - 11:09:50 AM
Last modification on : Wednesday, July 6, 2022 - 4:17:51 AM




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, 2011, 71 (10), pp.1356-1366. ⟨10.1016/j.jpdc.2011.06.004⟩. ⟨hal-00788764⟩



Record views