Interactive Oracle Proofs with Constant Rate and Query Complexity

By Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner. 2017

49 citations recorded by the source corpus.

Subfields: Artificial Intelligence

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

1. Dan Boneh
2. Henry Corrigan-Gibbs
3. Yuval Ishai
4. Eli Ben-Sasson
5. Michael Riabzev
6. Elette Boyle
7. Niv Gilboa
8. Madars Virza

Citations in the corpus

• Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019, background): “While it is possible in principle to construct such strongly linear PCPs and IOPs by combining standard PCPs or IOPs of proximity [20,24] with linear error-correcting codes, this generic combination may not yield the best achievable parameters.”
• Aurora: Transparent Succinct Arguments for R1CS (2019, methodology): “Unfortunately, [16] relies on other expensive tools, such as algebraic-geometry (AG) codes and quasilinear-size PCPs of proximity [27]; moreover, it is not zero knowledge.”