Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes

We consider the proximity testing problem for error-correcting codes which consist in evaluations of multivariate polynomials either of bounded individual degree or bounded total degree. Namely, given an oracle function f : L m → F q , where L ⊂ F q , a verifier distinguishes whether f is the evalua...

Ausführliche Beschreibung