Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck

@article{BenSasson2016ShortIO,
  title={Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck},
  author={Eli Ben-Sasson and Alessandro Chiesa and Ariel Gabizon and Michael Riabzev and Nicholas Spooner},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2016},
  volume={23},
  pages={46}
}
We study interactive oracle proofs (IOPs) [BCS16, RRR16], which combine aspects of probabilistically checkable proofs (PCPs) and interactive proofs (IPs). We present IOP constructions and techniques that let us achieve tradeoffs in proof length versus query complexity that are not known to be achievable via PCPs or IPs alone. Our main results are: 1… CONTINUE READING