An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions

@article{Kilian1995AnEN,
  title={An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions},
  author={Joe Kilian and Erez Petrank},
  journal={Journal of Cryptology},
  year={1995},
  volume={11},
  pages={1-27}
}
We consider noninteractive zero-knowledge proofs in the shared random string model proposed by Blum et al. [5]. Until recently there was a sizable polynomial gap between the most efficient noninteractive proofs for NP based on general complexity assumptions [11] versus those based on specific algebraic assumptions [7]. Recently, this gap was reduced to a polylogarithmic factor [17]; we further reduce the gap to a constant factor. Our proof system relies on the existence of one-way permutations… CONTINUE READING
Highly Cited
This paper has 108 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 56 extracted citations

108 Citations

051015'96'01'07'13'19
Citations per Year
Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.