Four-message black-box ZK proofs ⊆ CZK

Inclusion · folklore

Statement

Every language with a four-message black-box zero-knowledge proof is in CZK, with the same protocol. The protocol is an interactive proof with completeness and negligible soundness error against every prover. For each non-uniform PPT verifier , runs in expected polynomial time, and its output is indistinguishable from the view of by every family of polynomial-size circuits that receives . That is the condition of CZK, with as the non-uniform simulator — folklore.