Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Ynon Horesh:

TR17-134 | 8th September 2017
Eli Ben-Sasson, Iddo Bentov, Ynon Horesh, Michael Riabzev

Fast Reed-Solomon Interactive Oracle Proofs of Proximity

Revisions: 2

The family of Reed-Solomon (RS) codes plays a prominent role in the construction of quasilinear probabilistically checkable proofs (PCPs) and interactive oracle proofs (IOPs) with perfect zero knowledge and polylogarithmic verifiers. The large concrete computational complexity required to prove membership in RS codes is one of the biggest obstacles to ... more >>>

ISSN 1433-8092 | Imprint