Welcome to the resource topic for 2010/656
Title:
A Note on Constant-Round Zero-Knowledge Proofs of Knowledge
Authors: 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.
ePrint: https://eprint.iacr.org/2010/656
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .