next up previous
Next: Source to Destination Communication Up: The Technion Period (1986-94) Previous: On Sparse Pseudorandom Ensembles

How to Construct Constant-Round Zero-Knowledge Proof Systems for NP

The natural construction, in which the verifier first commits to queries, and then a query-response protocol takes place, is shown to work. One key ingrediant in the proof is solving a technical problem that arises in the simulation of this construction.


Comments: Authored by O. Goldreich and A. Kahan. Appeared in



Oded Goldreich
2003-07-30