How to Construct Constant-Round Zero-Knowledge Proof Systems for NP (1995)
by
Oded Goldreich
,
Ariel Kahan
| Venue: | Journal of Cryptology |
| Citations: | 132 - 8 self |
BibTeX
@ARTICLE{Goldreich95howto,
author = {Oded Goldreich and Ariel Kahan},
title = {How to Construct Constant-Round Zero-Knowledge Proof Systems for NP},
journal = {Journal of Cryptology},
year = {1995},
volume = {9},
pages = {167--189}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Constant-round zero-knowledge proof systems for every language in NP are presented, assuming the existence of a collection of claw-free functions. In particular, it follows that such proof systems exist assuming the intractability of either the Discrete Logarithm Problem or the Factoring Problem for Blum Integers.
