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 ...

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 ...

Paper 2001/051. Black-Box Concurrent Zero-Knowledge Requires Ω ~ ( log ⁡ n ) Rounds. Ran Canetti, Joe Kilian, Erez Petrank, and Alon Rosen. Abstract.

... The best result, which uses black box simulation, has ω(log n) round complexity [PRS02], where n is the security parameter. This nearly matches the best ...

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

Abstract. We show that any concurrent zero-knowledge protocol for a nontrivial language. (i.e., for a language outside BPP), whose security is proven via ...

It is shown that any concurrent zero-knowledge protocol for a nontrivial language must use at least $\tilde\Omega(\log n)$ rounds of interaction, ...

Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579.

This result achieves a substantial improvement over previous lower bounds and is the first bound to rule out the possibility of constant-round concurrent zero- ...

Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds. STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing.