1. Lower Bounds For Concurrent Zero Knowledge*.
- Author
-
Joe Kilian, Charles Rackoff, and Erez Petrank
- Subjects
NUMERICAL calculations ,CARDINAL numbers ,ZERO (The number) ,NUMERICAL analysis - Abstract
We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many interactive proofs, and these proofs may take place in an asynchronous fashion. It is known that zero-knowledge is not necessarily preserved in such an environment; we show that for a large class of protocols, it cannot be preserved. Any 4 round (computational) zero-knowledge interactive proof (or argument) for a non-trivial language L is not black-box simulatable in the asynchronous setting. [ABSTRACT FROM AUTHOR]
- Published
- 2005