Lower Bounds for Zero Knowledge on the Internet (1998)
| Venue: | In 39th FOCS |
| Citations: | 47 - 5 self |
BibTeX
@INPROCEEDINGS{Kilian98lowerbounds,
author = {Joe Kilian and Erez Petrank and Charles Rackoff},
title = {Lower Bounds for Zero Knowledge on the Internet},
booktitle = {In 39th FOCS},
year = {1998},
pages = {484--492},
publisher = {IEEE}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1. Introduction Zero knowledge [16] turned out to be a useful tool for many cryptographic applications. Many works have studied the numerous uses of zero knowledge proofs, and many other works have suggested how to improve the efficiency of these proofs. However, most of these works considered only the case where the proof stands alone, disconnected from the computing environment. An interesting question, which naturally arises these days, is ...
Citations
No citations identified.
