# Pinocchio: Nearly Practical Verifiable Computation Content type: Research Paper Summary: The Pinocchio system presents a significant advancement in the field of verifiable computation, demonstrating a method for creating computationally sound and nearly practical proofs for arbitrary computations. It allows a prover to generate a proof that a computation was performed correctly, and a verifier can check this proof efficiently without re-executing the entire computation. Pinocchio builds upon techniques from homomorphic encryption and zero-knowledge proofs, specifically utilizing the Key concepts: Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova, verifiable computation, zero-knowledge proof, cryptography, privacy, secure computation, zk-snarks, computational integrity, pinocchio
Paperexpert

Pinocchio: Nearly Practical Verifiable Computation

Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova

IACR ePrint ArchiveJanuary 2013

Abstract

The Pinocchio system presents a significant advancement in the field of verifiable computation, demonstrating a method for creating computationally sound and nearly practical proofs for arbitrary computations. It allows a prover to generate a proof that a computation was performed correctly, and a verifier can check this proof efficiently without re-executing the entire computation. Pinocchio builds upon techniques from homomorphic encryption and zero-knowledge proofs, specifically utilizing the Groth-Sahai proof system and incorporating techniques to reduce the proof size and verification time. The system achieves efficiency by offloading the bulk of the computation verification to the prover, requiring the verifier only to perform a small, constant number of operations regardless of the computation's complexity. While not fully "zero-knowledge" in the strictest sense, it offers a compelling trade-off between proof generation cost and verification efficiency, making verifiable computation more accessible for practical applications, including blockchains and secure multi-party computation.

Key Findings

  • 1Pinocchio enables efficient generation and verification of proofs for arbitrary computations.
  • 2It allows a verifier to confirm computation correctness without re-executing the entire process.
  • 3The system leverages techniques from homomorphic encryption and zero-knowledge proofs for efficiency.
  • 4Pinocchio achieves nearly practical performance by minimizing verifier workload, making verifiable computation more accessible.

Topics

verifiable computationzero-knowledge proofcryptographyprivacysecure computationzk-snarkscomputational integritypinocchio
Download / View

Citation

Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova (2013). Pinocchio: Nearly Practical Verifiable Computation. IACR ePrint Archive. https://eprint.iacr.org/2013/279

BibTeX

@misc{pinocchionearly2013,
  title = {Pinocchio: Nearly Practical Verifiable Computation},
  author = {Bryan Parno and Jon Howell and Craig Gentry and Mariana Raykova},
  year = {2013},
  howpublished = {\url{https://eprint.iacr.org/2013/279}},
}

Knowledge Explorer

Explore Related Concepts

See how Pinocchio: Nearly Practical Verifiable Computation connects to glossary terms, books, and other research in the Knowledge Graph.

Explore Connections