Interactive Oracle Proofs

DOI10.1007/978-3-662-53644-5_2zbMath1397.94048OpenAlexW2536319456MaRDI QIDQ3181021

Nicholas Spooner, Alessandro Chiesa, Eli Ben-Sasson

Publication date: 22 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_2

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Subquadratic SNARGs in the random oracle model ⋮ An algebraic framework for universal and updatable SNARKs ⋮ Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ Tight state-restoration soundness in the algebraic group model ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ Interactive Oracle Proofs ⋮ SoK: communication across distributed ledgers ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs ⋮ Asymptotically quasi-optimal cryptography ⋮ A PCP theorem for interactive proofs and applications ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Succinct arguments in the quantum random oracle model ⋮ Linear-size constant-query IOPs for delegating computation ⋮ On the (In)security of Kilian-based SNARGs ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Plumo: an ultralight blockchain client ⋮ Witness-succinct universally-composable SNARKs ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Parallelizable delegation from LWE ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Succinct arguments for RAM programs via projection codes ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ Succinct interactive oracle proofs: applications and limitations ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Lower bound on SNARGs in the random oracle model ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Quantum rewinding for many-round protocols ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ 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 ⋮ Algebraic reductions of knowledge ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Tight security bounds for Micali's SNARGs ⋮ Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds ⋮ Zero-Knowledge Proofs of Proximity ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs ⋮ 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 ⋮ Unnamed Item ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Interactive proofs for social graphs ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures

Uses Software

Pinocchio

Cites Work