By Topic

Collusion-Resistant Sabotage-Tolerance Mechanisms for Volunteer Computing Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Watanabe, K. ; Grad. Sch. of Inf. Sci., Tohoku Univ., Sendai, Japan ; Fukushi, M. ; Horiguchi, S.

This paper presents a proposal of a collusion-resistant sabotage-tolerance mechanism against malicious sabotage attempts in volunteer computing (VC) systems. While VC systems reach the most powerful computing platforms, they are vulnerable to mischief because volunteers can output erroneous results, for various reasons ranging from hardware failure to intentional sabotage. To protect the integrity of data and validate the computation results, most VC systems rely on the replication-based sabotage-tolerance mechanisms such as the m-first voting. However, these mechanisms are powerless against malicious volunteers (saboteurs) that have intention and use some form of collusion. To face this collusion threat, this paper proposes a spot-checking-based mechanism, which estimates the frequency of malicious attempts and dynamically eliminates erroneous results from the system. Simulation of VCs shows that the proposed method can improve the performance of VC systems up to 30 percent, while guaranteeing the same level of computational correctness.

Published in:

e-Business Engineering, 2009. ICEBE '09. IEEE International Conference on

Date of Conference:

21-23 Oct. 2009