Black-box concurrent zero-knowledge requires Ω̃(log n) Rounds

Ran Canetti*, Joe Kilian, Erez Petrank, Alon Rosen

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

96 Scopus citations

Abstract

We show that any concurrent zero-knowledge protocol for a non-trivial language (i.e., for a language outside BPP), whose security is proven via black-box simulation, must use at least Ω̃(log n) rounds of interaction. This result substantially improves over previous lower bounds, and is the first bound to rule out the possibility of constant-round black-box concurrent zero-knowledge. Furthermore, the bound is polynomially related to the number of rounds in the best known concurrent zero-knowledge protocol for languages in NP.

Original languageEnglish
Pages (from-to)570-579
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
StatePublished - 2001
Externally publishedYes
Event33rd Annual ACM Symposium on Theory of Computing - Creta, Greece
Duration: 6 Jul 20018 Jul 2001

Fingerprint

Dive into the research topics of 'Black-box concurrent zero-knowledge requires Ω̃(log n) Rounds'. Together they form a unique fingerprint.

Cite this