Lower Bounds for Zero-knowledge on the Internet

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.

Keywords

Cryptography and Security, D.4.6

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30676

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0107003
 http://arxiv.org/abs/cs/0107003

Collections

arXiv