*00:17*[Pub][JoC] A Note on Constant-Round Zero-Knowledge Proofs of Knowledge

Abstract In this note, we show the existence of *constant-round* computational zero-knowledge *proofs of knowledge* for all . The existence of constant-round zero-knowledge proofs was proven by Goldreich and Kahan (Journal of Cryptology, 1996), and the existence of constant-round zero-knowledge *arguments* of knowledge was proven by Feige and Shamir (CRYPTO, 1989). However, the existence of constant-round zero-knowledge proofs of knowledge for all is folklore, to the best of our knowledge, since no proof of this fact has been published.

- Content Type Journal Article
- Pages 1-17
- DOI 10.1007/s00145-012-9132-7
- Authors
- Yehuda Lindell, Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

- Journal Journal of Cryptology
- Online ISSN 1432-1378
- Print ISSN 0933-2790