Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes

63Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Gennaro, Gentry, Parno and Raykova proposed an efficient NIZK argument for Circuit-SAT, based on non-standard tools like conscientious and quadratic span programs. We propose a new linear PCP for the Circuit-SAT, based on a 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). This allows us to simplify all steps of the argument, which results in significantly improved efficiency. We then construct an NIZK Circuit-SAT argument based on existing techniques. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Lipmaa, H. (2013). Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8269 LNCS, pp. 41–60). https://doi.org/10.1007/978-3-642-42033-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free