Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 638-654 |
| Number of pages | 17 |
| Journal | Journal of Cryptology |
| Volume | 26 |
| Issue number | 4 |
| DOIs | |
| State | Published - Oct 2013 |
Bibliographical note
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).
Funding
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).
| Funders | Funder number |
|---|---|
| Seventh Framework Programme | 239868 |
| European Commission | |
| Israel Science Foundation | 189/11 |