Concurrent Zero-Knowledge With Timing, Revisited

This work shows that a known constant-round zero-knowledge proof for NP preserves its security when polynomially-many independent copies are executed concurrently under the above timing model. The analysis combines the treatment of two extreme schedulings of concurrent executions under the above timing model: the first extreme scheduling, which is of independent interest, is the parallel execution of polynomially-many copies.

Comments: Authored by O. Goldreich. Appeared in

• Proc. of the 34th STOC, pages 332-340, 2002.