Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions

ePrint Report: Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions

Helger Lipmaa, Roberto Parisella, Janno Siim

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 …

argument box compiler eprint report non pcs prove report roberto simple size under