next up previous
Next: A Note on Computational Up: The Technion Period (1986-94) Previous: The Best of Both

On the Composition of Zero-Knowledge Proof Systems

It is shown that the basic (or vanilla) definition of zero-knowledge is not closed under sequential composition, whereas none of the known notions is closed under parallel composition. Furthermore, it is shown that constant-round public-coin protocols (of negligible error) cannot be proven zero-knowledge via black-box simulators.


Comments: Authored by O. Goldreich and H. Krawczyk. Appeared in



Oded Goldreich
2003-07-30