Defeating Colluding Nodes in Desktop Grid Computing Platforms



Desktop Grid systems reached a preeminent place
among the most powerful computing platforms in the
planet. Unfortunately, they are extremely vulnerable to mis-
chief, because volunteers can output bad results, for reasons
ranging from faulty hardware (like over-clocked CPUs) to
intentional sabotage. To mitigate this problem, Desktop
Grid projects replicate work units and apply majority vot-
ing, typically on 2 or 3 results.

In this paper, we observe that this form of replication is
powerless against malicious volunteers that have the inten-
tion and the (simple) means to ruin the project using some
form of collusion. We argue that each work unit needs at
least 3 voters and that voting pools with conflicts enable the
master to spot colluding malicious nodes. Hence, we post-
process the voting pools in two steps: i) we use a statistical
approach to identify nodes that were not colluding, but sub-
mitted bad results; ii) we use a rather simple principle to
go after malicious nodes which acted together: they might
have won conflicting voting pools against nodes that were
not identified in step i. We use simulation to show that our
heuristic can be quite effective against colluding nodes, in
scenarios where honest nodes form a majority.


Desktop Grid


Workshop on Desktop Grids and Volunteer Computing Systems (PCGrid 2008), April 2008

PDF File

Cited by

Year 2015 : 4 citations

 [HTML] Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion
AF Anta, C Georgiou, MA Mosteiro, D Pareja - PloS one, 2015 -
Abstract We consider a computing system where a master processor assigns a task for
execution to worker processors that may collude. We model the workers' decision of whether
to comply (compute the task) or not (return a bogus result to save the computation cost) as ...
Cited by 1 Related articles All 9 versions Cite Save More

 [PDF] from
Contributions to Desktop Grid Computing
G Fedak - 2015 -
Since the mid 90's, Desktop Grid Computing-ie the idea of using a large number of remote
PCs distributed on the Internet to execute large parallel applications-has proved to be an
efficient paradigm to provide a large computational power at the fraction of the cost of a ...
Cite Save

 Virtual Screening in a Desktop Grid: Replication and the Optimal Quorum
I Chernov, N Nikitina - Parallel Computing Technologies, 2015 - Springer
Abstract We propose a mathematical model of a desktop grid computing system that solves
tasks with two possible answers. Replication is used in order to reduce the error risk: wrong
answers are returned with some known probabilities and penalty is added to the ...
Cited by 2 Cite Save

 A MapReduce-based algorithm for parallelizing collusion detection in Hadoop
M Mortazavi, BT Ladani - Information and Knowledge …, 2015 -
Abstract—MapReduce as a programming model for parallel data processing has been used
in many open systems such as cloud computing and service-oriented computing. Collusive
behavior of worker entities in MapReduce model can violate integrity concern of open ...
Cite Save

Year 2013 : 1 citations

author = {Antonio Fern{\'a}ndez Anta and
Chryssis Georgiou and
Miguel A. Mosteiro},
title = {Algorithmic Mechanisms for Reliable Internet-based Computing
under Collusion},
journal = {CoRR},
volume = {abs/1307.1650},
year = {2013},
ee = {},
bibsource = {DBLP,}

Year 2010 : 6 citations

 Eugen Staab, “Reliable Information Acquisition in the Presence of Malicious Sources”, PhD Thesis, University of Luxembourg, Luxembourg, April 2010

 Canon, L.C. and Jeannot, E. and Weissman, J.,” A Scheduling Algorithm for Defeating Collusion”, 2010

 Canon, L.C., “Coping with uncertainty in scheduling problems”, Parallel & Distributed Processing, Workshops and PhD Forum (IPDPSW), 2010 IEEE International Symposium on, pp.1-4, 2010

 Melski, D., “Safety in Numbers”, 2010

 Canon, L.C. and Jeannot, E. and Weissman, J., "A Dynamic Approach for Characterizing Collusion in Desktop Grids", Proceedings of the 2010 IEEE International Parallel and Distributed Processing (IPDPS), 2010

 Canon, L.C., “Outils et algorithmes pour gérer l’incertitude lors de l’ordonnancement d’application sur plateformes distribuées”, PhD Thesis, Université Henri Poincarré – Nancy 1, France, 2010

Year 2009 : 1 citations

 Collusion detection for grid [PDF]
E Staab, T Engel - Proceedings of the 2009 9th IEEE/ACM ?, 2009 -
A common technique for result verification in grid com- puting is to delegate a computation redundantly
to different workers and apply majority voting to the returned results. However, the technique
is sensitive to "collusion? where a majority of malicious workers collectively returns the ...
Cited by 3 - Related articles - All 4 versions

Year 2008 : 3 citations

 [PDF] ►Using correlation for collusion detection in grid settings
E Staab, V Fusenig, T Engel -
Eugen Staab, Volker Fusenig and Thomas Engel ... Faculty of Sciences,
Technology and Communication University of Luxembourg 6, rue R.
Coudenhove-Kalergi 1359 Luxembourg Luxembourg ... Using Correlation for ...
Cited by 2 - Related articles - View as HTML - Web Search

 [PDF] ►Grid Architectural Issues: State-of-the-art and Future Trends
A Andrzejak, C Mastroianni, P Fragopoulou, D Kondo ? -
1 Zuse-Institute Berlin, Takustr. 7, 14195 Berlin, Germany 2
ICAR-CNR Via P. Bucci 41C, 87036 Rende (CS) Italy 3
Foundation for Research and Technology-Hellas, Institute of Computer ...
Related articles - View as HTML - Web Search

 [PDF] ►Collusion Detection
E Staab -
Page 1. Collusion Detection For Acquisition of Unverifiable Information
Eugen Staab University of Luxembourg SECAN-Lab day
Amneville-Les-Thermes, France, June 30, 2008 Page 2. ...
Related articles - View as HTML - Web Search