DEEP-FRI: Sampling outside the box improves soundness

  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.},
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
10 Citations
Proximity Gaps for Reed–Solomon Codes
  • 4
  • PDF
Local Proofs Approaching the Witness Length [Extended Abstract]
Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes
  • PDF
Local Proofs Approaching the Witness Length
  • 11
  • PDF
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads
  • PDF
Transparent SNARKs from DARK Compilers
  • 46
  • PDF
High-Threshold AVSS with Optimal Communication Complexity
  • PDF
RedShift: Transparent SNARKs from List Polynomial Commitment IOPs
  • 6
  • Highly Influenced
  • PDF
Proof of All: Verifiable Computation in a Nutshell
  • PDF
Fractal: Post-Quantum and Transparent Recursive Proofs from Holography
  • 33
  • Highly Influenced
  • PDF


Worst-Case to Average Case Reductions for the Distance to a Code
  • 8
  • PDF
Fast Reed-Solomon Interactive Oracle Proofs of Proximity
  • 39
  • PDF
Aurora: Transparent Succinct Arguments for R1CS
  • 92
  • PDF
On Probabilistic Checking in Perfect Zero Knowledge
  • 13
  • PDF
Short PCPs with Polylog Query Complexity
  • 145
  • PDF
Nearly-linear size holographic proofs
  • 190