State of the Art Report: Verified Computation
Jim Woodcock, Mikkel Schmidt Andersen, Diego F. Aranha, Stefan, Hallerstede, Simon Thrane Hansen, Nikolaj Kuhne Jakobsen, Tomas Kulik, Peter, Gorm Larsen, Hugo Daniel Macedo, Carlos Ignacio Isasa Martin, Victor, Alexander Mtsimbe Norrild

TL;DR
This report surveys the current state of verifiable computation, covering theoretical foundations and practical implementations, based on an extensive review of 128 papers and over 4,000 pages in the field.
Contribution
It provides a comprehensive overview of the theoretical and practical aspects of verifiable computation, summarizing major concepts and recent advancements in the field.
Findings
Major concepts in probabilistically checkable proofs
Advances in zero-knowledge proof systems
Current practical implementations of verifiable computation
Abstract
This report describes the state of the art in verifiable computation. The problem being solved is the following: The Verifiable Computation Problem (Verifiable Computing Problem) Suppose we have two computing agents. The first agent is the verifier, and the second agent is the prover. The verifier wants the prover to perform a computation. The verifier sends a description of the computation to the prover. Once the prover has completed the task, the prover returns the output to the verifier. The output will contain proof. The verifier can use this proof to check if the prover computed the output correctly. The check is not required to verify the algorithm used in the computation. Instead, it is a check that the prover computed the output using the computation specified by the verifier. The effort required for the check should be much less than that required to perform the computation.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Cryptography and Data Security · Complexity and Algorithms in Graphs
