You are looking at a specific version 20120924:192139 of this paper.
See the latest version.
Paper 2010/656
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge
Yehuda Lindell
Abstract
In this note, we show the existence of \emph{constant-round} computational zero-knowledge \emph{proofs of knowledge} for all $\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 \emph{arguments} of knowledge was proven by Feige and Shamir (CRYPTO 1989). However, the existence of constant-round zero-knowledge proofs of knowledge for all $\NP$ is folklore, to the best of our knowledge, since no proof of this fact has been published.
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- zero-knowledge proofsproofs of knowledgeconstant number of rounds
- Contact author(s)
- lindell @ cs biu ac il
- History
- 2012-09-24: last of 4 revisions
- 2010-12-31: received
- See all versions
- Short URL
- https://ia.cr/2010/656
- License
-
CC BY