Uncheatable grid computing

Wenliang Du; Jing Jia; Manish Mangal; Mummoorthy Murugesan

doi:10.1109/icdcs.2004.1281562

Uncheatable grid computing

Wenliang Du, Jing Jia, Manish Mangal, Mummoorthy Murugesan

Department of Electrical Engineering & Computer Science

Research output: Contribution to conference › Paper › peer-review

101 Scopus citations

Abstract

Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x ₁,...,x_n}, it needs to compute f(x) for all x ∈ D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel scheme to achieve the uncheatable grid computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable grid computing.

Original language	English (US)
Pages	4-11
Number of pages	8
DOIs	https://doi.org/10.1109/icdcs.2004.1281562
State	Published - 2004
Event	Proceedings - 24th International Conference on Distributed Computing Systems - Hachioji, Tokyo, Japan Duration: Mar 24 2004 → Mar 26 2004

Other

Other	Proceedings - 24th International Conference on Distributed Computing Systems
Country/Territory	Japan
City	Hachioji, Tokyo
Period	3/24/04 → 3/26/04

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1109/icdcs.2004.1281562

Cite this

@conference{5d522462035845c4af697046d737c199,

title = "Uncheatable grid computing",

abstract = "Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x 1,...,xn}, it needs to compute f(x) for all x ∈ D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel scheme to achieve the uncheatable grid computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable grid computing.",

author = "Wenliang Du and Jing Jia and Manish Mangal and Mummoorthy Murugesan",

year = "2004",

doi = "10.1109/icdcs.2004.1281562",

language = "English (US)",

pages = "4--11",

note = "Proceedings - 24th International Conference on Distributed Computing Systems ; Conference date: 24-03-2004 Through 26-03-2004",

}

TY - CONF

T1 - Uncheatable grid computing

AU - Du, Wenliang

AU - Jia, Jing

AU - Mangal, Manish

AU - Murugesan, Mummoorthy

PY - 2004

Y1 - 2004

N2 - Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x 1,...,xn}, it needs to compute f(x) for all x ∈ D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel scheme to achieve the uncheatable grid computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable grid computing.

AB - Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x 1,...,xn}, it needs to compute f(x) for all x ∈ D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel scheme to achieve the uncheatable grid computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable grid computing.

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

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

U2 - 10.1109/icdcs.2004.1281562

DO - 10.1109/icdcs.2004.1281562

M3 - Paper

AN - SCOPUS:2442421200

SP - 4

EP - 11

T2 - Proceedings - 24th International Conference on Distributed Computing Systems

Y2 - 24 March 2004 through 26 March 2004

ER -

Uncheatable grid computing

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this