DMCA
Delegating computation reliably: Paradigms and Constructions (2009)
| Citations: | 7 - 1 self |
BibTeX
@MISC{Rothblum09delegatingcomputation,
author = {Guy N. Rothblum},
title = { Delegating computation reliably: Paradigms and Constructions},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In an emerging computing paradigm, computational capabilities, from processing power to storage capacities, are offered to users over communication networks as a service. This new paradigm holds enormous promise for increasing the utility of computationally weak devices. A natural approach is for weak devices to delegate expensive tasks, such as storing a large file or running a complex computation, to more powerful entities (say servers) connected to the same network. While the delegation approach seems promising, it raises an immediate concern: when and how can a weak device verify that a computational task was completed correctly? This practically motivated question touches on foundational questions in cryptography and complexity theory. The focus of this thesis is verifying the correctness of delegated computations. We con-struct efficient protocols (interactive proofs) for delegating computational tasks. In particular, we present: e A protocol for delegating any computation, where the work needed to verify the correctness of the output is linear in the input length, polynomial in the computation's
Keyphrases
computational task expensive task immediate concern weak de-vices complexity theory communication network weak device delegated computation efficient protocol motivated question touch input length weak device verify new paradigm interactive proof enormous promise complex computation natural approach powerful entity large file computational capability delegation approach foundational question computing paradigm
