Searching for high-value rare events with uncheatable grid computing

Wenliang Du, Michael T. Goodrich

Research output: Contribution to journalConference Articlepeer-review

21 Scopus citations


High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (which comprise the computation grid) in such a way that clients are rewarded for performing tasks assigned to them. Although natural, rare-event searching presents significant challenges for a computation supervisor, who partitions and distributes the search space out to clients while contending with "lazy" clients, who don't do all their tasks, and "hoarding" clients, who don't report rare events back to the supervisor. We provide schemes, based on a technique we call chaff injection, for efficiently performing uncheatable grid computing in the context of searching for high-value rare events in the presence of coalitions of lazy and hoarding clients.

Original languageEnglish (US)
Pages (from-to)122-137
Number of pages16
JournalLecture Notes in Computer Science
StatePublished - 2005
EventThird International Conference on Applied Cryptography and Network Security, ACNS 2005 - New York, NY, United States
Duration: Jun 7 2005Jun 10 2005


  • Cheating
  • Cryptographic hash functions
  • Grid computing
  • Obfuscation
  • Security

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Searching for high-value rare events with uncheatable grid computing'. Together they form a unique fingerprint.

Cite this