Modeling and Performance Evaluation of Colluding Attack in Volunteer Computing Systems

Kan Watanabe, Nobuo Funabiki, Torn Nakanishi, Masaru Fukushi · International MultiConference of Engineers and Computer Scientists · 2012

This paper proposes a model of a colluding attack in Volunteer Computing (VC), where some of participants are unreliable and may return incorrect results. The colluding attack is one of most important issues to realize reliable VC because it may ruin most basic assumption, i.e. the majority in voting is correct. Especially, check-by-voting archives largest efficiency by sorting reliable participants based on whether their results are majority or not. Thus, if some incorrect results become majority by colluding attack, it may have significant impacts on check-by-voting. In this paper, we perform a Monte Carlo simulation of VC using proposed colluding model and evaluate sabotage-tolerance performance of voting methods. Simulation results show that check-by-voting works well if colluding attack happens.

Read the paper · More papers on PaperTik