2-round zero knowledge and proof auditors
Cynthia Dwork, Larry Stockmeyer · 2002
We construct 2-round (i.e., 2-message), public-coin, black-box (concurrent) zero-knowledge proof systems and arguments for any language in NP under the assumption that the prover is resource-bounded during the execution of the protocol.