In this paper we show how to construct noninteractive zero knowledge proofs for any NP statement under general (rather than number theoretic) assumptions, and how to enable polynomially many provers to give polynomially many such proofs based on a single random string. Our constructions can be used in cryptographic applications in which the prover is restricted to polynomial time.
Uriel Feige,Dror Lapidot,Adi Shamir. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions[J]. SIAM Journal on Computing,2000-01-01,29(1):1-28.
