Cryptology ePrint Archive: Report 2017/872

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability

Jonathan Bootle and Andrea Cerulli and Essam Ghadafi and Jens Groth and Mohammad Hajiabadi and Sune K. Jakobsen

Abstract: We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfiability over a large field. For a circuit with N addition and multiplication gates, the prover only uses O(N) multiplications and the verifier only uses O(N) additions in the field. If the commitments we use are statistically binding, our zero-knowledge proofs have unconditional soundness, while if the commitments are statistically hiding we get computational soundness. Our zero-knowledge proofs also have sub-linear communication if the commitment scheme is compact.

Our construction proceeds in three steps. First, we give a zero-knowledge proof for arithmetic circuit satisfiability in an ideal linear commitment model where the prover may commit to secret vectors of field elements, and the verifier can receive certified linear combinations of those vectors. Second, we show that the ideal linear commitment proof can be instantiated using error-correcting codes and non-interactive commitments. Finally, by choosing efficient instantiations of the primitives we obtain linear-time zero-knowledge proofs.

Category / Keywords: Zero-knowledge, arithmetic circuit, ideal linear commitments

Original Publication (with major differences): IACR-ASIACRYPT-2017

Date: received 7 Sep 2017, last revised 7 Sep 2017

Contact author: jonathan bootle 14 at ucl ac uk, andrea cerulli 13@ucl ac uk, essam ghadafi@googlemail com, j groth@ucl ac uk, m hajiabadi@ucl ac uk, s jakobsen@ucl ac uk

Available format(s): PDF | BibTeX Citation

Version: 20170913:212148 (All versions of this report)

Short URL: ia.cr/2017/872

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]