Next: A Note on Computational
Up: The Technion Period (1986-94)
Previous: The Best of Both
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
- Proc. of the 17th ICALP,
Lecture Notes in Computer Science, Vol. 443, Springer Verlag,
pp. 268-282, 1990.
- SIAM Jour. on Comp.,
Vol. 25, No. 1, February 1996, pp. 169-192.
Oded Goldreich
2003-07-30