DEEP-FRI: Sampling outside the box improves soundness
@article{BenSasson2019DEEPFRISO, title={DEEP-FRI: Sampling outside the box improves soundness}, author={E. Ben-Sasson and Lior Goldberg and Swastik Kopparty and S. Saraf}, journal={IACR Cryptol. ePrint Arch.}, year={2019}, volume={2019}, pages={336} }
Motivated by the quest for scalable and succinct zero knowledge arguments, we revisit worst-case-to-average-case reductions for linear spaces, raised by [Rothblum, Vadhan, Wigderson, STOC 2013]. We first show a sharp quantitative form of a theorem which says that if an affine space $U$ is $\delta$-far in relative Hamming distance from a linear code $V$ - this is the worst-case assumption - then most elements of $U$ are almost $\delta$-far from $V$ - this is the average case. This leads to an… Expand
Figures and Topics from this paper
10 Citations
Proximity Gaps for Reed–Solomon Codes
- Computer Science
- 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
- 2020
- 4
- PDF
Local Proofs Approaching the Witness Length [Extended Abstract]
- Computer Science
- 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
- 2020
Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes
- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2020
- PDF
Local Proofs Approaching the Witness Length
- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2019
- 11
- PDF
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2020
- PDF
High-Threshold AVSS with Optimal Communication Complexity
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2021
- PDF
RedShift: Transparent SNARKs from List Polynomial Commitment IOPs
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2019
- 6
- Highly Influenced
- PDF
Fractal: Post-Quantum and Transparent Recursive Proofs from Holography
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2019
- 33
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 21 REFERENCES
Worst-Case to Average Case Reductions for the Distance to a Code
- Mathematics, Computer Science
- Computational Complexity Conference
- 2018
- 8
- PDF
Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2017
- 39
- PDF
Aurora: Transparent Succinct Arguments for R1CS
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2018
- 92
- PDF
Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Computer Science, Mathematics
- STOC
- 2014
- 33
- PDF
On Probabilistic Checking in Perfect Zero Knowledge
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2016
- 13
- PDF
Robust pcps of proximity, shorter pcps and applications to coding
- Mathematics, Computer Science
- STOC '04
- 2004
- 117
- PDF