Delegating Computation

DOI10.1145/2699436zbMath1393.68071OpenAlexW2071520502WikidataQ114614133 ScholiaQ114614133MaRDI QIDQ3177732

Yael Tauman Kalai, Guy N. Rothblum

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2699436

zbMATH Keywords

interactive proofsverifiable computingdelegating computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (24)

Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Succinct arguments in the quantum random oracle model ⋮ Constant-Round Interactive Proof Systems for AC0[2 and NC1] ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ Parallelizable delegation from LWE ⋮ Energy complexity of computation ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Succinct interactive oracle proofs: applications and limitations ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ Secure and efficient delegation of elliptic-curve pairing ⋮ How to Verify a Quantum Computation ⋮ Elimination-based certificates for triangular equivalence and rank profiles ⋮ No-signaling linear PCPs ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Unnamed Item ⋮ Outsourcing computation: the minimal refereed mechanism ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Round-optimal black-box commit-and-prove with succinct communication

Uses Software

• BOINC

This page was built for publication: Delegating Computation