Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds

Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen. Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds. Electronic Colloquium on Computational Complexity (ECCC), 8(50), 2001. [doi]

Authors

Ran Canetti

This author has not been identified. Look up 'Ran Canetti' in Google

Joe Kilian

This author has not been identified. Look up 'Joe Kilian' in Google

Erez Petrank

This author has not been identified. Look up 'Erez Petrank' in Google

Alon Rosen

This author has not been identified. Look up 'Alon Rosen' in Google