TY - JOUR
T1 - A note on constant-round zero-knowledge proofs of knowledge
AU - Lindell, Yehuda
N1 - Funding Information: This research was supported by the European Research Council as part of the ERC project “LAST”, and by the israel science foundation (grant No. 189/11).
PY - 2013/10
Y1 - 2013/10
N2 - In this note, we show the existence of constant-round computational zero-knowledge 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 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.
AB - In this note, we show the existence of constant-round computational zero-knowledge 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 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.
UR - http://www.scopus.com/inward/record.url?scp=84890426043&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/s00145-012-9132-7
DO - https://doi.org/10.1007/s00145-012-9132-7
M3 - مقالة
SN - 0933-2790
VL - 26
SP - 638
EP - 654
JO - Journal of Cryptology
JF - Journal of Cryptology
IS - 4
ER -