Modeling and performance evaluation of colluding attack in volunteer computing systems

Kan Watanabe, Nobuo Funabiki, Torn Nakanishi, Masaru Fukushi

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

2 Citations (Scopus)

Abstract

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 the most important issues to realize reliable VC because it may ruin the most basic assumption, i.e. "the majority in voting is correct". Especially, check-by-voting archives the largest efficiency by sorting reliable participants based on whether their results are the majority or not. Thus, if some incorrect results become the 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 the proposed colluding model and evaluate the sabotage-tolerance performance of voting methods. Simulation results show that check-by-voting works well if colluding attack happens.

Original languageEnglish
Title of host publicationLecture Notes in Engineering and Computer Science
PublisherNewswood Limited
Pages1658-1663
Number of pages6
Volume2196
ISBN (Print)9789881925190
Publication statusPublished - 2012
Event2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 - Kowloon, Hong Kong
Duration: Mar 14 2012Mar 16 2012

Other

Other2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012
CountryHong Kong
CityKowloon
Period3/14/123/16/12

Fingerprint

Sorting
Monte Carlo simulation

Keywords

  • Desktop Grids
  • Job Scheduling
  • Mathematical Modeling
  • Parallel Computing

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Watanabe, K., Funabiki, N., Nakanishi, T., & Fukushi, M. (2012). Modeling and performance evaluation of colluding attack in volunteer computing systems. In Lecture Notes in Engineering and Computer Science (Vol. 2196, pp. 1658-1663). Newswood Limited.

Modeling and performance evaluation of colluding attack in volunteer computing systems. / Watanabe, Kan; Funabiki, Nobuo; Nakanishi, Torn; Fukushi, Masaru.

Lecture Notes in Engineering and Computer Science. Vol. 2196 Newswood Limited, 2012. p. 1658-1663.

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

Watanabe, K, Funabiki, N, Nakanishi, T & Fukushi, M 2012, Modeling and performance evaluation of colluding attack in volunteer computing systems. in Lecture Notes in Engineering and Computer Science. vol. 2196, Newswood Limited, pp. 1658-1663, 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012, Kowloon, Hong Kong, 3/14/12.
Watanabe K, Funabiki N, Nakanishi T, Fukushi M. Modeling and performance evaluation of colluding attack in volunteer computing systems. In Lecture Notes in Engineering and Computer Science. Vol. 2196. Newswood Limited. 2012. p. 1658-1663
Watanabe, Kan ; Funabiki, Nobuo ; Nakanishi, Torn ; Fukushi, Masaru. / Modeling and performance evaluation of colluding attack in volunteer computing systems. Lecture Notes in Engineering and Computer Science. Vol. 2196 Newswood Limited, 2012. pp. 1658-1663
@inproceedings{721b8c2aed5541b49aea2aa316080080,
title = "Modeling and performance evaluation of colluding attack in volunteer computing systems",
abstract = "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 the most important issues to realize reliable VC because it may ruin the most basic assumption, i.e. {"}the majority in voting is correct{"}. Especially, check-by-voting archives the largest efficiency by sorting reliable participants based on whether their results are the majority or not. Thus, if some incorrect results become the 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 the proposed colluding model and evaluate the sabotage-tolerance performance of voting methods. Simulation results show that check-by-voting works well if colluding attack happens.",
keywords = "Desktop Grids, Job Scheduling, Mathematical Modeling, Parallel Computing",
author = "Kan Watanabe and Nobuo Funabiki and Torn Nakanishi and Masaru Fukushi",
year = "2012",
language = "English",
isbn = "9789881925190",
volume = "2196",
pages = "1658--1663",
booktitle = "Lecture Notes in Engineering and Computer Science",
publisher = "Newswood Limited",

}

TY - GEN

T1 - Modeling and performance evaluation of colluding attack in volunteer computing systems

AU - Watanabe, Kan

AU - Funabiki, Nobuo

AU - Nakanishi, Torn

AU - Fukushi, Masaru

PY - 2012

Y1 - 2012

N2 - 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 the most important issues to realize reliable VC because it may ruin the most basic assumption, i.e. "the majority in voting is correct". Especially, check-by-voting archives the largest efficiency by sorting reliable participants based on whether their results are the majority or not. Thus, if some incorrect results become the 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 the proposed colluding model and evaluate the sabotage-tolerance performance of voting methods. Simulation results show that check-by-voting works well if colluding attack happens.

AB - 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 the most important issues to realize reliable VC because it may ruin the most basic assumption, i.e. "the majority in voting is correct". Especially, check-by-voting archives the largest efficiency by sorting reliable participants based on whether their results are the majority or not. Thus, if some incorrect results become the 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 the proposed colluding model and evaluate the sabotage-tolerance performance of voting methods. Simulation results show that check-by-voting works well if colluding attack happens.

KW - Desktop Grids

KW - Job Scheduling

KW - Mathematical Modeling

KW - Parallel Computing

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

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

M3 - Conference contribution

AN - SCOPUS:84867440941

SN - 9789881925190

VL - 2196

SP - 1658

EP - 1663

BT - Lecture Notes in Engineering and Computer Science

PB - Newswood Limited

ER -