Constant-round public-coin HVZK proof ⇒ HVZK
Statement
A constant-round public-coin HVZK proof for an -complete language is an interactive proof for that language with negligible soundness error that is honest-verifier zero-knowledge, with the same prover, verifier and simulator — folklore.