Constant-Round Concurrent Zero Knowledge in the Bounded Player Model

  title={Constant-Round Concurrent Zero Knowledge in the Bounded Player Model},
  author={Vipul Goyal and Abhishek Jain and Rafail Ostrovsky and Silas Richelson and Ivan Visconti},
In [18] Goyal et al. introduced the bounded player model for secure computation. In the bounded player model, there are an a priori bounded number of players in the system, however, each player may execute any unbounded (polynomial) number of sessions. They showed that even though the model consists of a relatively mild relaxation of the standard model, it allows for round-efficient concurrent zero knowledge. Their protocol requires a super-constant number of rounds. In this work we show… CONTINUE READING
6 Citations
55 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 55 references

- 31 st Annual International Conference on the Theory and Applications of Cryptographic Techniques

  • I. Visconti
  • Lecture Notes in Computer Science
  • 2012

Similar Papers

Loading similar papers…