Interactive Oracle Proofs

By Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner. Theory of Cryptography Conference, 2016

359 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/3cf7f1025a92524cd00e2cabc14af46a8073ee06

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, background): “Third, zkSTARKs [14] and Aurora [19] build on interactive oracle proofs (IOPs) [20, 78], a generalization of PCPs and IPs.”
Transparent SNARKs from DARK Compilers (2020, methodology): “As a secondary contribution, we present a framework that uniﬁes all existing approaches to constructing SNARKs from polynomial commitments using the language of interactive oracle proofs (IOPs) [45,7].”
Doubly-Efficient zkSNARKs Without Trusted Setup (2018, positive): “builds non-interactive ZK arguments from short PCPs, following the seminal work of Kilian [62, 63] and Micali [73], the landmark result of Ben-Sasson and Sudan [17], and recent generalizations of PCPs [9, 14, 87].”
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017, methodology): “In [9], the soundness of the transformed protocol is shown to essentially match the soundness of the original protocol up to an additive term that roughly depends on the product of q2 and 2−λ where q is an upper bound on the number of queries made to the random oracle by a malicious prover and λ is ”
Aurora: Transparent Succinct Arguments for R1CS (2019, methodology): “The codebase uses the C++ language and has three main components: (1) a library for writing IOP protocols; (2) a realization of the [21] transformation, mapping any IOP written with our library to a corresponding noninteractive argument; (3) a portfolio of IOP protocols, including our new IOP protoc”
Scalable Zero Knowledge with No Trusted Setup (2019, methodology): “The IOP7 model suggested in [22, 67] is a generalization of the IP [44], PCP [2], and interactive PCP (IPCP) [53] models.”
Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017, methodology): “Observing that (i) these PCPPs are built using recursive PCPP composition [BGH + 06], and (ii) only a small fraction of recursive branches are explored by the verifier, we increase the number of rounds of interaction and use a notarized interactive proof of proximity (NIPP) [BBGR16], a special case ”
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, background): “STARKs [9] look to simultaneously minimise proof size and verifier computation and show, with an implementation, that protocols based on interactive oracle proofs [14] can be practical.”
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS (2020, background): “Interactive oracle proofs (IOPs) [BCS16; RRR16] are multi-round protocols where in each round the veriﬁer sends a challenge and the prover sends an oracle (which the veriﬁer can query).”
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019, methodology): “[21] show how to compile such proofs into SNARGs in the random-oracle model and recent hash-based SNARGs, including Ligero [2], STARK [15], and Aurora [20] are built using this technique.”
Zether: Towards Privacy in a Smart Contract World (2020, methodology): “All of the ZK-proofs in our instantiation of Zether are derived from interactive proofs and then transformed to non-interactive proofs using the Fiat-Shamir heuristic [4, 39].”
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, result): “Though GKR protocol is not constant round, recent results [14, 22] show that applying Fiat-Shamir only incurs a polynomial soundness loss in the number of rounds in GKR.”