Lower Bounds for Zero-knowledge on the Internet
| dc.creator | Kilian, Joe | |
| dc.creator | Petrank, Erez | |
| dc.creator | Rackoff, Charles | |
| dc.date | 2001-07-02 | |
| dc.date | 2001-07-11 | |
| dc.date.accessioned | 2026-07-07T03:17:18Z | |
| dc.date.available | 2026-07-07T03:17:18Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0107003 | |
| dc.identifier | http://arxiv.org/abs/cs/0107003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30676 | |
| dc.subject | Cryptography and Security | |
| dc.subject | D.4.6 | |
| dc.title | Lower Bounds for Zero-knowledge on the Internet | |
| dc.type | text |