Skip to main content
Article thumbnail
Location of Repository

Hardening Functions for Large-Scale Distributed Computations

By et al. Doug Szajda

Abstract

Many recent large-scale distributed computing applications utilize spare processor cycles of personal computers that are connected to the Internet. The resulting distributed computing platforms provide computational power that previously was available only through the use of expensive supercomputers. However, distributed computations running in untrusted environments raise a number of security concerns, including the potential for disrupting computations and for claiming credit for computing that has not been completed (i.e., cheating). This paper presents two strategies for hardening selected applications that utilize such distributed computations. Specifically, we show that carefully seeding certain tasks with precomputed data can significantly increase resistance to cheating and to disrupting the computation. We obtain similar results for sequential tasks by sharing the computation of Æ tasks among K > N nodes. In each case, the associated cost is significantly less than the cost of assigning tasks redundantly

Topics: distributed computation, probabilistic verification
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.8261
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mathcs.richmond.edu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.