On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions

ePrint Report: On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions

Helger Lipmaa, Roberto Parisella, Janno Siim

Lipmaa, Parisella, and Siim [Eurocrypt, 2024] proved the extractability of the KZG polynomial commitment scheme under the falsifiable assumption ARSDH. They also showed that variants of real-world zk-SNARKs like Plonk can be made knowledge-sound in the random oracle model (ROM) under the ARSDH assumption. However, their approach did not consider various batching optimizations, resulting in their variant of Plonk having approximately 3.5 times …

can eprint report eurocrypt knowledge real report roberto rom sound under world zk-snarks