Fast Reed-Solomon Interactive Oracle Proofs of Proximity

By Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev. Electron. Colloquium Comput. Complex., 2017

303 citations recorded by the source corpus.

How researchers see this paper

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

Scalable, transparent, and post-quantum secure computational integrity (2018, methodology): “[14] Eli Ben-Sasson, Iddo Bentov, Ynon Horesh, and Michael Riabzev.”
Scalable Zero Knowledge with No Trusted Setup (2019, methodology): “Our new ZK-STARK builds signiﬁcantly on recent ZK-IOP research [22, 13, 15, 11], and its main advantage is improved efﬁciency , leading to it being the ﬁrst strictly scal-18 able IOP for space bounded computation (Theorem 1).”
Aurora: Transparent Succinct Arguments for R1CS (2019, methodology): “This approach, pioneered in [50, 45, 60, 29], relied on combining certain linearly homomorphic encodings with lightweight information-theoretic tools known as linear PCPs [54, 29, 71]; this approach was refined and optimized in several works [23, 22, 40, 51, 30, 52].”
Transparent SNARKs from DARK Compilers (2020, background): “Recently, Vlasov and Panarin [50], concurrently with Zhang et al. [56], show how to build a transparent polynomial commitment based on FRI (Fast Reed Solomon IOPP) [3].”
Doubly-Efficient zkSNARKs Without Trusted Setup (2018, background): “The authors reduce the concrete overheads associated with these approaches [10] and implement zero-knowledge scalable transparent arguments of knowledge (zkSTARKs) [11].”