Paper 2024/173 Original: eprint.iacr.org/2024/173 ↗
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions
Abstract
We prove that the seminal KZG polynomial commitment scheme (PCS) is black-box extractable under a simple falsifiable assumption ARSDH. To create an interactive argument, we construct a compiler that combines a black-box extractable non-interactive PCS and a polynomial IOP (PIOP). The compiler incurs a minor cost per every committed polynomial. Applying the Fiat-Shamir transformation, we obtain slightly less efficient variants of well-known PIOP-based zk-SNARKs, such as Plonk, that are knowledge-sound in the ROM under the ARSDH assumption. Importantly, there is no need for idealized group models or knowledge assumptions. This results in the first known zk-SNARKs in the ROM from falsifiable assumptions with both an efficient prover and constant-size argument.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-06-04: last updated
- 2024-02-05: published
- Short URL
- https://ia.cr/2024/173
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/173,
author = {Helger Lipmaa and Roberto Parisella and Janno Siim},
title = {Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/173},
year = {2024},
url = {https://eprint.iacr.org/2024/173}
}