Uncheatable grid computing

Wenliang Du, Jing Jia, Manish Mangal, Mummoorthy Murugesan

Research output: Contribution to conferencePaper

80 Scopus citations


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.

Original languageEnglish (US)
Number of pages8
StatePublished - 2004
EventProceedings - 24th International Conference on Distributed Computing Systems - Hachioji, Tokyo, Japan
Duration: Mar 24 2004Mar 26 2004


OtherProceedings - 24th International Conference on Distributed Computing Systems
CityHachioji, Tokyo

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Uncheatable grid computing'. Together they form a unique fingerprint.

  • Cite this

    Du, W., Jia, J., Mangal, M., & Murugesan, M. (2004). Uncheatable grid computing. 4-11. Paper presented at Proceedings - 24th International Conference on Distributed Computing Systems, Hachioji, Tokyo, Japan. https://doi.org/10.1109/icdcs.2004.1281562