Delegating computation: interactive proofs for muggles
From MaRDI portal
Publication:3177732
DOI10.1145/2699436zbMATH Open1393.68071OpenAlexW2071520502WikidataQ114614133 ScholiaQ114614133MaRDI QIDQ3177732FDOQ3177732
Authors: Yael Tauman Kalai, Guy N. Rothblum, Shafi Goldwasser 
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (46)
- Competing-provers protocols for circuit evaluation
- Constant-Round Interactive Proof Systems for AC0[2] and NC1
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Energy complexity of computation
- Title not available (Why is that?)
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Parallelizable delegation from LWE
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Two protocols for delegation of computation
- The power of distributed verifiers in interactive proofs
- Simple doubly-efficient interactive proof systems for locally-characterizable sets
- Witness indistinguishability for any single-round argument with applications to access control
- Round-optimal black-box commit-and-prove with succinct communication
- Ligero: lightweight sublinear arguments without a trusted setup
- Interactive proofs of proximity: delegating computation in sublinear time
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Non-interactive publicly-verifiable delegation of committed programs
- Time-optimal interactive proofs for circuit evaluation
- Practical verified computation with streaming interactive proofs
- How to Verify a Quantum Computation
- Competing provers protocols for circuit evaluation
- Secure and efficient delegation of elliptic-curve pairing
- Constant-round interactive proofs for delegating computation
- No-signaling linear PCPs
- SNARGs for P from sub-exponential DDH and QR
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- SPARKs: succinct parallelizable arguments of knowledge
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
- Succinct arguments in the quantum random oracle model
- Constant-round interactive proofs for delegating computation
- Elimination-based certificates for triangular equivalence and rank profiles
- Outsourcing computation: the minimal refereed mechanism
- Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures
- Verifying and decoding in constant depth
- Functional commitments for arbitrary circuits of bounded sizes
- Constant-round arguments from one-way functions
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Zero-knowledge IOPs approaching witness length
- Title not available (Why is that?)
- Rational arguments: single round delegation with sublinear verification
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Succinct interactive oracle proofs: applications and limitations
- Refereed delegation of computation
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
Uses Software
This page was built for publication: Delegating computation: interactive proofs for muggles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177732)
