Lower Bounds for Zero-knowledge on the Internet
<|reference_start|>Lower Bounds for Zero-knowledge on the Internet: 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.<|reference_end|>
@article{kilian2001lower,
    title={Lower Bounds for Zero-knowledge on the Internet},
    author={Joe Kilian and Erez Petrank and Charles Rackoff},
    journal={arXiv preprint arXiv:cs/0107003},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0107003},
    primaryClass={cs.CR}
}