2001/07/02 by Joe Kilian, Kilian, Joe, Erez Petrank +3
Computer Science · #Cryptography and Data Security #Cryptography and Security (cs.CR) #D.4.6 #FOS: Computer and information sciences #Internet Traffic Analysis and Secure E-voting #Privacy-Preserving Technologies in Data #cs.CR
paper · pdf · doi:10.48550/arxiv.cs/0107003
openalex publication_date 2001/07/02 · arxiv created 2001/07/11 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.