From Polynomial IOP and Commitments to Non-malleable zkSNARKs

ePrint Report: From Polynomial IOP and Commitments to Non-malleable zkSNARKs

Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac

We study sufficient conditions for compiling simulation-extractable zkSNARKs from information-theoretic interactive oracle proofs (IOP) using a simulation-extractable commit-and-prove system for its oracles.
Specifically, we define simulation extractability for opening and evaluation proofs of polynomial commitment schemes, which we then employ to prove the security of zkSNARKS obtained from polynomial IOP prove systems, such as Plonk and Marlin. To instantiate our …

conditions eprint report evaluation information non oracle prove report security simulation study system systems zksnarks