Constant-round interactive proofs for delegating computation
From MaRDI portal
Publication:5361818
DOI10.1145/2897518.2897652zbMath1373.68274OpenAlexW2416431186MaRDI QIDQ5361818
Omer Reingold, Ron D. Rothblum, Guy N. Rothblum
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2897518.2897652
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (51)
Time- and space-efficient arguments from groups of unknown order ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ Proofs of proximity for context-free languages and read-once branching programs ⋮ Interactive Oracle Proofs ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ A PCP theorem for interactive proofs and applications ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Gemini: elastic SNARKs for diverse environments ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Succinct arguments in the quantum random oracle model ⋮ Linear-size constant-query IOPs for delegating computation ⋮ On the (In)security of Kilian-based SNARGs ⋮ Unnamed Item ⋮ Constant-Round Interactive Proof Systems for AC0[2 and NC1] ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Unnamed Item ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ A toolbox for barriers on interactive oracle proofs ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Pseudo-deterministic Proofs ⋮ Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds ⋮ Zero-Knowledge Proofs of Proximity ⋮ Proofs of Proximity for Distribution Testing ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Elimination-based certificates for triangular equivalence and rank profiles ⋮ Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP ⋮ Transparent SNARKs from DARK compilers ⋮ 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 ⋮ Delegation with updatable unambiguous proofs and PPAD-hardness ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
This page was built for publication: Constant-round interactive proofs for delegating computation
