Name
Abstract | ||
|---|---|---|
Non-Interactive Zero-Knowledge Proof Systems have been proven to exist under a specific complexity assumption; namely, under the Quadratic Residuosity Assumption which gives rise to a specific secure probabilistic encryption scheme.In this paper we prove that the existence of any secure probabilistic encryption scheme, actually any one-way encryption scheme, is enough for Non-Interactive Zero-Knowledge in a modified model. That is, we show that the ability to prove a randomly chosen theorem allows to subsequently prove noninteractively and in Zero-Knowledge any smaller size theorem whose proof is discovered. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1007/0-387-34799-2_21 | CRYPTO '88 Proceedings on Advances in cryptology |
Keywords | Field | DocType |
non-interactive zero-knowledge proof systems,quadratic residuosity assumption,secure probabilistic encryption scheme,specific complexity assumption,one-way encryption scheme,non-interactive zero-knowledge,smaller size theorem,specific secure probabilistic encryption,modified model,zero knowledge | Discrete mathematics,Computer science,Quadratic equation,Theoretical computer science,Encryption,Preprocessor,Probabilistic encryption,Zero-knowledge proof | Conference |
Volume | ISSN | ISBN |
403 | 0302-9743 | 0-387-97196-3 |
Citations | PageRank | References |
24 | 2.87 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alfredo De Santis | 1 | 4049 | 501.27 |
| Silvio Micali | 2 | 11434 | 2581.31 |
| G. Persiano | 3 | 173 | 20.19 |