A maximum independent set approach for collusion detection in voting pools

Araujo, Filipe; Farinha, Jorge; Domingues, Patrício; Silaghi, Gheorghe Cosmin; Kondo, Derrick

http://hdl.handle.net/10400.8/14671

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
66.pdf		1013.44 KB	Adobe PDF	Download

Send Feedback

Authors

Araujo, Filipe

Farinha, Jorge

Domingues, Patrício

Silaghi, Gheorghe Cosmin

Kondo, Derrick

Abstract(s)

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 naïve 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.

Keywords

Volunteer computing Maximum independent set Collusion detection

URI

http://hdl.handle.net/10400.8/14671

Citation

Filipe Araujo, Jorge Farinha, Patricio Domingues, Gheorghe Cosmin Silaghi, Derrick Kondo, A maximum independent set approach for collusion detection in voting pools, Journal of Parallel and Distributed Computing, Volume 71, Issue 10, 2011, Pages 1356-1366, ISSN 0743-7315, https://doi.org/10.1016/j.jpdc.2011.06.004