Noninteractive Zero-Knowledge (1991)
Cached
Download Links
| Venue: | SIAM J. COMPUTING |
| Citations: | 156 - 17 self |
BibTeX
@MISC{Blum91noninteractivezero-knowledge,
author = {Manuel Blum and Alfredo De Santis and Silvio Micali and Giuseppe Persiano},
title = {Noninteractive Zero-Knowledge},
year = {1991}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zero-knowledge proofs exist for some number-theoretic languages for which no efficient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, it is shown that the NP-complete language of satisfiability also possesses noninteractive zero-knowledge proofs.
