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.
Liste complète des métadonnées

https://hal.inria.fr/hal-00788764
Contributor : Arnaud Legrand <>
Submitted on : Friday, February 15, 2013 - 11:09:50 AM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM

Identifiers

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⟩

Share

Metrics

Record views

213