International Association for Cryptologic Research
Recently, the researchers proposed an efficient non-interactive zero knowledge argument for Circuit-SAT, based on non-standard notions like conscientious and quadratic span programs. The authors propose a new non-interactive zero knowledge argument, based on a simple combination of standard span programs (that verify the correctness of every individual gate) and high-distance linear error-correcting codes (that check the consistency of wire assignments). They simplify all steps of the argument. As one of the corollaries, they design an (optimal) wire checker, based on systematic Reed-Solomon codes, of size 8n and degree 4n, while the wire checker from has size 24n and degree 76n, where n is the circuit size.