Defeating colluding nodes in desktop grid computing platforms
Authors
Abstract
Desktop Grid systems reached a preeminent place among the most powerful computing platforms in the planet. Unfortunately, they are extremely vulnerable to mischief, because computing projects exert no administrative or technical control on volunteers. These can very easily output bad results, due to software or hardware glitches (resulting from over-clocking for instance), to get unfair computational credit, or simply to ruin the project. To mitigate this problem, Desktop Grid servers replicate work units and apply majority voting, typically on 2 or 3 results.In this paper, we observe that simple majority voting is powerless against malicious volunteers that collude to attack the project. We argue that to identify this type of attack and to spot colluding nodes, each work unit needs \emph{at least} 3 voters. In addition, we propose to post-process the voting pools in two steps. $i$) In the first step, we use a statistical approach to identify nodes that were not colluding, but submitted bad results; $ii$) then, 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.
Subject
Desktop GridJournal
Journal of Grid Computing, Vol. 7, #4, pp. 555-573, Springer, December 2009PDF File
Cited by
Year 2014 : 2 citations
[PDF] Reliable peer-to-peer computing system
M ZOCHNIAK, B SAWICKI - red.pe.org.pl
Abstract. Paper discuss a heterogeneous, distributed computing system commonly referred
as a volunteer computing. Mechanism of determining correctness of results, based on
replication and trust modeling, is proposed. In presented solution owners of computational ...
Cited by 1 Related articles All 4 versions Cite Save More
The Effectiveness of Reputation-based Voting for Collusion Tolerance in Large-Scale Grids
M Essaaidi, A Bendahmane, A El Moussaoui, Y Ali - ieeexplore.ieee.org
Abstract—Large scale grids permit to share grid resources spread over different
autonomous administrative sites in the internet. The rapid progress of grid systems opens
the door for numerous companies to adopt this technology in their business development. ...
Cite Save
Create alert
Year 2013 : 1 citations
Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion http://arxiv.org/abs/1307.1650 AF Anta, C Georgiou, MA Mosteiro arXiv preprint arXiv:1307.1650 2013 arxiv.org
Year 2012 : 1 citations
Xu Ling, ”Security Mechanisms for Distributed Computing Systems”, PhD Thesis, Tohoku University, 2012. (http://hdl.handle.net/10097/53937)
Year 2011 : 2 citations
Gianluca Ciccarelli, Renato Lo Cigno, Collusion in peer-to-peer systems, Computer Networks, Volume 55, Issue 15, 27 October 2011, pp 3517-3532, ISSN 1389-1286, 10.1016/j.comnet.2011.06.028.
Canon, L., Jeannot, E., Weissman, J., "A Scheduling and Certification Algorithm for Defeating Collusion in Desktop Grids", 31st International Conference on Distributed Computing Systems (ICDCS), pp 343-352, 2011
Year 2010 : 7 citations
REPORTS ON SYSTEMS AND COMMUNICATIONS http://gsyc.es/tr-docs/RoSaC-2010-1.pdf AF Anta, A Milani, MA Mosteiro, S Zaks - http://gsyc.es/tr-docs/RoSaC-2010-1.pdf
Safety in Numbers http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA532995 D Melski, D Cok, J Phillips, S Wisniewski, SH Yong… Publication/NA 2010
L.-C. Canon. Coping with uncertainty in scheduling problems. In {em Parallel Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on}, pages 1 --4, April 2010.
L.-C. Canon, E.~Jeannot, and J.~Weissman. A dynamic approach for characterizing collusion in desktop grids. In {em Parallel Distributed Processing (IPDPS), 2010 IEEE International Symposium on}, pages 1 --12, April 2010.
{L}ouis-{C}laude {C}anon, {E}mmanuel {J}eannot, and {J}on {W}eissman.
{A} {S}cheduling {A}lgorithm for {D}efeating {C}ollusion. Research Report {RR}-7403, INRIA, 10 2010.
Eugen Staab. {em Reliable Information Acquisition in the Presence of Malicious Sources}. PhD thesis, University of Luxembourg, April 2010. Online Version, 2010-04-22.
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 : 2 citations
Eugen Staab and Thomas Engel. Collusion detection for grid computing. In Franck Cappello, Cho-Li Wang, and Rajkumar Buyya, editors, {\em Proceedings of the 9th IEEE/ACM International Symposium on Cluster Computing and the Grid CCGrid '09)}, pages 412--419. IEEE Computer Society, May 2009.
Kan Watanabe, Masaru Fukushi, and Susumu Horiguchi. Collusion-resistant sabotage-tolerance mechanisms for volunteer computing systems. e-Business Engineering, IEEE International Conference on, 0:213--218, 2009.
Year 2008 : 1 citations
Eugen Staab, Volker Fusenig, and Thomas Engel. Using correlation for collusion detection in grid settings, 2008.