Name
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 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.jpdc.2011.06.004 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Collusion detection,Maximum independent set,Volunteer computing | Graph,Software execution,Voting,Identifier,Computer security,Computer science,Independent set,Volunteer computing,Collusion,Distributed computing | Journal |
Volume | Issue | ISSN |
71 | 10 | 0743-7315 |
Citations | PageRank | References |
10 | 0.58 | 32 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Filipe Araujo | 1 | 214 | 24.63 |
| Jorge Farinha | 2 | 10 | 0.58 |
| Domingues, P. | 3 | 180 | 17.68 |
| Gheorghe Cosmin Silaghi | 4 | 147 | 16.99 |
| Derrick Kondo | 5 | 1541 | 82.99 |