Performance evaluation of check-by-voting for colluding attack in volunteer computing systems

Kan Watanabe, Masaru Fukushi, Nobuo Funabiki, Toru Nakanishi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Volunteer computing (VC) is a type of Internet based parallel computing paradigm, which allows any participants in the Internet to contribute their idle computing resources towards solving large problems. In VC, sabotage-tolerance mechanism is mandatory to improve the reliability of computations because some malicious participants may sabotage their jobs by returning incorrect results. Then, this paper evaluates current sabotage-tolerance methods such as voting and presents an impact of colluding attack on the sabotage-tolerance performance. The colluding attack is one of the most important issues to realize reliable modern VC systems because it may ruin the fundamental assumption of voting, i.e., "the majority is correct". This becomes a big threat to the voting-based sabotage-tolerant methods which eliminate malicious participants based on whether their results are the majority or not. In this paper, we propose a colluding attack model, and conduct a detailed study for two major voting-based methods (i.e., M-first voting and check-by-voting) through a Monte Carlo simulation to reveal the sabotage-tolerance performance against colluding attacks. Our model introduces a colluding probability to cover various sabotaging and colluding scenarios. The simulation study shows that check-by-voting works well even if colluding attacks happen, while M-first voting does not.

Original languageEnglish
Title of host publicationLecture Notes in Electrical Engineering
Pages33-48
Number of pages16
Volume186 LNEE
DOIs
Publication statusPublished - 2013
EventInternational MultiConference of Engineers and Computer Scientists 2012, IMECS 2012 - Hong Kong, Hong Kong
Duration: Mar 14 2012Mar 16 2012

Publication series

NameLecture Notes in Electrical Engineering
Volume186 LNEE
ISSN (Print)18761100
ISSN (Electronic)18761119

Other

OtherInternational MultiConference of Engineers and Computer Scientists 2012, IMECS 2012
CountryHong Kong
CityHong Kong
Period3/14/123/16/12

Fingerprint

Internet
Parallel processing systems
Monte Carlo simulation

Keywords

  • Check-by-voting
  • Colluding attacks
  • Desktop grids
  • Majority voting
  • Sabotage-tolerance
  • Volunteer computing

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Watanabe, K., Fukushi, M., Funabiki, N., & Nakanishi, T. (2013). Performance evaluation of check-by-voting for colluding attack in volunteer computing systems. In Lecture Notes in Electrical Engineering (Vol. 186 LNEE, pp. 33-48). (Lecture Notes in Electrical Engineering; Vol. 186 LNEE). https://doi.org/10.1007/978-94-007-5651-9-3

Performance evaluation of check-by-voting for colluding attack in volunteer computing systems. / Watanabe, Kan; Fukushi, Masaru; Funabiki, Nobuo; Nakanishi, Toru.

Lecture Notes in Electrical Engineering. Vol. 186 LNEE 2013. p. 33-48 (Lecture Notes in Electrical Engineering; Vol. 186 LNEE).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Watanabe, K, Fukushi, M, Funabiki, N & Nakanishi, T 2013, Performance evaluation of check-by-voting for colluding attack in volunteer computing systems. in Lecture Notes in Electrical Engineering. vol. 186 LNEE, Lecture Notes in Electrical Engineering, vol. 186 LNEE, pp. 33-48, International MultiConference of Engineers and Computer Scientists 2012, IMECS 2012, Hong Kong, Hong Kong, 3/14/12. https://doi.org/10.1007/978-94-007-5651-9-3
Watanabe K, Fukushi M, Funabiki N, Nakanishi T. Performance evaluation of check-by-voting for colluding attack in volunteer computing systems. In Lecture Notes in Electrical Engineering. Vol. 186 LNEE. 2013. p. 33-48. (Lecture Notes in Electrical Engineering). https://doi.org/10.1007/978-94-007-5651-9-3
Watanabe, Kan ; Fukushi, Masaru ; Funabiki, Nobuo ; Nakanishi, Toru. / Performance evaluation of check-by-voting for colluding attack in volunteer computing systems. Lecture Notes in Electrical Engineering. Vol. 186 LNEE 2013. pp. 33-48 (Lecture Notes in Electrical Engineering).
@inproceedings{1bba311ab7ea46e9ac9e27d06f7f8f59,
title = "Performance evaluation of check-by-voting for colluding attack in volunteer computing systems",
abstract = "Volunteer computing (VC) is a type of Internet based parallel computing paradigm, which allows any participants in the Internet to contribute their idle computing resources towards solving large problems. In VC, sabotage-tolerance mechanism is mandatory to improve the reliability of computations because some malicious participants may sabotage their jobs by returning incorrect results. Then, this paper evaluates current sabotage-tolerance methods such as voting and presents an impact of colluding attack on the sabotage-tolerance performance. The colluding attack is one of the most important issues to realize reliable modern VC systems because it may ruin the fundamental assumption of voting, i.e., {"}the majority is correct{"}. This becomes a big threat to the voting-based sabotage-tolerant methods which eliminate malicious participants based on whether their results are the majority or not. In this paper, we propose a colluding attack model, and conduct a detailed study for two major voting-based methods (i.e., M-first voting and check-by-voting) through a Monte Carlo simulation to reveal the sabotage-tolerance performance against colluding attacks. Our model introduces a colluding probability to cover various sabotaging and colluding scenarios. The simulation study shows that check-by-voting works well even if colluding attacks happen, while M-first voting does not.",
keywords = "Check-by-voting, Colluding attacks, Desktop grids, Majority voting, Sabotage-tolerance, Volunteer computing",
author = "Kan Watanabe and Masaru Fukushi and Nobuo Funabiki and Toru Nakanishi",
year = "2013",
doi = "10.1007/978-94-007-5651-9-3",
language = "English",
isbn = "9789400756236",
volume = "186 LNEE",
series = "Lecture Notes in Electrical Engineering",
pages = "33--48",
booktitle = "Lecture Notes in Electrical Engineering",

}

TY - GEN

T1 - Performance evaluation of check-by-voting for colluding attack in volunteer computing systems

AU - Watanabe, Kan

AU - Fukushi, Masaru

AU - Funabiki, Nobuo

AU - Nakanishi, Toru

PY - 2013

Y1 - 2013

N2 - Volunteer computing (VC) is a type of Internet based parallel computing paradigm, which allows any participants in the Internet to contribute their idle computing resources towards solving large problems. In VC, sabotage-tolerance mechanism is mandatory to improve the reliability of computations because some malicious participants may sabotage their jobs by returning incorrect results. Then, this paper evaluates current sabotage-tolerance methods such as voting and presents an impact of colluding attack on the sabotage-tolerance performance. The colluding attack is one of the most important issues to realize reliable modern VC systems because it may ruin the fundamental assumption of voting, i.e., "the majority is correct". This becomes a big threat to the voting-based sabotage-tolerant methods which eliminate malicious participants based on whether their results are the majority or not. In this paper, we propose a colluding attack model, and conduct a detailed study for two major voting-based methods (i.e., M-first voting and check-by-voting) through a Monte Carlo simulation to reveal the sabotage-tolerance performance against colluding attacks. Our model introduces a colluding probability to cover various sabotaging and colluding scenarios. The simulation study shows that check-by-voting works well even if colluding attacks happen, while M-first voting does not.

AB - Volunteer computing (VC) is a type of Internet based parallel computing paradigm, which allows any participants in the Internet to contribute their idle computing resources towards solving large problems. In VC, sabotage-tolerance mechanism is mandatory to improve the reliability of computations because some malicious participants may sabotage their jobs by returning incorrect results. Then, this paper evaluates current sabotage-tolerance methods such as voting and presents an impact of colluding attack on the sabotage-tolerance performance. The colluding attack is one of the most important issues to realize reliable modern VC systems because it may ruin the fundamental assumption of voting, i.e., "the majority is correct". This becomes a big threat to the voting-based sabotage-tolerant methods which eliminate malicious participants based on whether their results are the majority or not. In this paper, we propose a colluding attack model, and conduct a detailed study for two major voting-based methods (i.e., M-first voting and check-by-voting) through a Monte Carlo simulation to reveal the sabotage-tolerance performance against colluding attacks. Our model introduces a colluding probability to cover various sabotaging and colluding scenarios. The simulation study shows that check-by-voting works well even if colluding attacks happen, while M-first voting does not.

KW - Check-by-voting

KW - Colluding attacks

KW - Desktop grids

KW - Majority voting

KW - Sabotage-tolerance

KW - Volunteer computing

UR - http://www.scopus.com/inward/record.url?scp=84872579214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872579214&partnerID=8YFLogxK

U2 - 10.1007/978-94-007-5651-9-3

DO - 10.1007/978-94-007-5651-9-3

M3 - Conference contribution

SN - 9789400756236

VL - 186 LNEE

T3 - Lecture Notes in Electrical Engineering

SP - 33

EP - 48

BT - Lecture Notes in Electrical Engineering

ER -