Competing provers protocols for circuit evaluation
Gillat Kol, Ran Raz · 2013
Let C be a (fan-in 2) Boolean circuit of size s and depth d, and let x be an input for C. Assume that a verifier that knows C but doesn't know x can access the low degree extension of x at one random point. Two competing provers try to convince the verifier that C(x)=0 and C(x)=1, respectively, and assume that one of the provers is honest.