Paper 2014/396 Original: eprint.iacr.org/2014/396 ↗
Prover-Efficient Commit-And-Prove Zero-Knowledge SNARKs
Abstract
Zk-SNARKs (succinct non-interactive zero-knowledge arguments of knowledge) are needed in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are either inefficient for the prover, or are non-adaptive and based on a commitment scheme that depends both on the prover's input and on the language, i.e., they are not commit-and-prove (CaP) SNARKs. We propose a proof-friendly extractable commitment scheme, and use it to construct prover-efficient adaptive CaP succinct zk-SNARKs for different languages, that can all reuse committed data. In new zk-SNARKs, the prover computation is dominated by a linear number of cryptographic operations. We use batch-verification to decrease the verifier's computation; importantly, batch-verification can be used also in QAP-based zk-SNARKs.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2020-04-23: last updated
- 2014-05-30: published
- Short URL
- https://ia.cr/2014/396
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/396,
author = {Helger Lipmaa},
title = {Prover-Efficient Commit-And-Prove Zero-Knowledge SNARKs},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/396},
year = {2014},
url = {https://eprint.iacr.org/2014/396}
}