activity
20042021
most citedElliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2019

DEEP-FRI: Sampling outside the box improves soundness

Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty +1

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, Wigderso…