Multiple noninteractive zero knowledge proofs under general assumptions

Authors
Feige, U Lapidot, D Shamir, A
Citation
U. Feige et al., Multiple noninteractive zero knowledge proofs under general assumptions, SIAM J COMP, 29(1), 1999, pp. 1-28
Citations number
29
Categorie Soggetti
Computer Science & Engineering
Journal title
SIAM JOURNAL ON COMPUTING
ISSN journal
00975397 → ACNP
Volume
29
Issue
1
Year of publication
1999
Pages
1 - 28
Database
ISI
SICI code
0097-5397(19990922)29:1<1:MNZKPU>2.0.ZU;2-A
Abstract
In this paper we show how to construct noninteractive zero knowledge proofs for any NP statement under general (rather than number theoretic) assumpti ons, 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 polynomi al time.