Lower Bounds for Zero-knowledge on the Internet
Cryptography and Security
2007-05-23 v2
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.
Keywords
Cite
@article{arxiv.cs/0107003,
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 = {2007}
}