**
Concurrent Zero Knowledge in the Bounded Player Model
**

*
Vipul Goyal,
Abhishek Jain,
Rafail Ostrovsky,
Silas Richelson,
Ivan Visconti
*

In this setting, we achieve concurrent Zero Knowledge(cZK) with* sub-logarithmic* round complexity.Our security proof is (necessarily) non-black-box, our simulator is “straight-line” and works as long as the number of rounds is ω(1).

We further show that unlike previously studied relaxation of the standard model (e.g., bounded number of sessions, timing assumptions, super-polynomial simulation), concurrent-secure computation is still impossible to achieve in the Bounded Player model. This gives evidence that our model is “closer” to the standard model than previously studied models, and study of this model might shed light on constructing round efficient concurrent *zero- Knowledge*
in the standard model as well.

**
Abstract:
**

**comment:**
TCC 2013: 60-79

Fetch PDF file of the paper

Back to Publications List |