articleMay 1, 2013GOLD OA

Pinocchio: Nearly Practical Verifiable Computation

Microsoft (United States) · IBM Research - Austin

Indexed incrossref

Abstract

To instill greater confidence in computations outsourced to the cloud, clients should be able to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions. With Pinocchio, the client creates a public evaluation key to describe her computation; this setup is proportional to evaluating the computation once. The worker then evaluates the computation on a particular input and uses the evaluation key to produce a proof of correctness. The proof is only 288 bytes, regardless of the computation performed or the size of the inputs and outputs. Anyone can use a public verification key…

Citation impact

833
total citations
FWCI
93.39
Percentile
100%
References
98
Citations per year

Authors

4

Topics & keywords

Keywords
  • Correctness
  • Computer science
  • Computation
  • Mathematical proof
  • Key (lock)
  • Verifiable secret sharing
  • Protocol (science)
  • Cryptography
No related works found for this paper.

Funding