## CryptoDB

### Paper: A Note on Constant-Round Zero-Knowledge Proofs of Knowledge

Authors: Yehuda Lindell DOI: 10.1007/s00145-012-9132-7 Search ePrint Search Google In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all $\mathcal {NP}$. 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 $\mathcal {NP}$ is folklore, to the best of our knowledge, since no proof of this fact has been published.
##### BibTeX
@article{jofc-2013-29474,
title={A Note on Constant-Round Zero-Knowledge Proofs of Knowledge},
journal={Journal of Cryptology},
publisher={Springer},
volume={26},
pages={638-654},
doi={10.1007/s00145-012-9132-7},
author={Yehuda Lindell},
year=2013
}