DEEP-FRI: Sampling Outside the Box Improves Soundness
Electronic Colloquium on Computational Complexity, pp. 3362019.
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]. 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 line...More
PPT (Upload PPT)