Next: On Yao's XOR-Lemma
Up: The First 1.5 Years
Previous: A Combinatorial Consistency Lemma
The main result in this paper is a transformation of public-coin
constant-round protocols that are zero-knowledge with respect to
the honest verifier into protocols that are zero-knowledge in the
general sense. The core of the transformation is a simple random
selection protocol, which is based on hashing functions
(rather than on a multi-round ``interactive hashing sub-protocol'').
Comments:
Authored by I. Damgard, O. Goldreich, T. Okamoto and A. Wigderson. Appeared in
- Crypto95 (Proceedings),
Lecture Note in Computer Science (963) Springer Verlag,
pp. 325-338, 1995.
Oded Goldreich
2003-07-30