TY - JOUR
T1 - Black-box concurrent zero-knowledge requires Ω̃(log n) Rounds
AU - Canetti, Ran
AU - Kilian, Joe
AU - Petrank, Erez
AU - Rosen, Alon
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0034830279&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0034830279
SN - 0734-9025
SP - 570
EP - 579
JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
T2 - 33rd Annual ACM Symposium on Theory of Computing
Y2 - 6 July 2001 through 8 July 2001
ER -