Perfect non-interactive zero knowledge for NP (2006)
Cached
Download Links
- [www.math.ucla.edu]
- [eprint.iacr.org]
- [www.cs.ucla.edu]
- [eprint.iacr.org]
- [www.cs.ucla.edu]
- [www.math.ucla.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of Eurocrypt 2006, volume 4004 of LNCS |
| Citations: | 31 - 3 self |
BibTeX
@INPROCEEDINGS{Groth06perfectnon-interactive,
author = {Jens Groth and Rafail Ostrovsky and Amit Sahai},
title = {Perfect non-interactive zero knowledge for NP},
booktitle = {Proceedings of Eurocrypt 2006, volume 4004 of LNCS},
year = {2006},
pages = {339--358},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, and various cryptographic protocols. What makes them especially attractive, is that they work equally well in a concurrent setting, which is notoriously hard for interactive zero-knowledge protocols. However, while for interactive zeroknowledge we know how to construct statistical zero-knowledge argument systems for all NP languages, for non-interactive zero-knowledge, this problem remained open since the inception of NIZK in the late 1980's. Here we resolve two problems regarding NIZK:- We construct the first perfect NIZK argument system for any NP
