Bounded Verification for Finite-Field-Blasting (In a Compiler for Zero Knowledge Proofs)

ePrint Report: Bounded Verification for Finite-Field-Blasting (In a Compiler for Zero Knowledge Proofs)

Alex Ozdemir, Riad S. Wahby, Fraser Brown, Clark Barrett

Zero Knowledge Proofs (ZKPs) are cryptographic protocols
by which a prover convinces a verifier of the truth of a statement with-
out revealing any other information. Typically, statements are expressed
in a high-level language and then compiled to a low-level representation
on which the ZKP operates. Thus, a bug in a ZKP compiler can com-
promise the statement …

alex compiler eprint report information knowledge protocols report statement truth verification zero knowledge zero knowledge proofs