Multiple noninteractive zero knowledge proofs under general assumptions

Uriel Feige; D Lapidot; Adi Shamir

doi:10.1137/S0097539792230010

Back

Multiple noninteractive zero knowledge proofs under general assumptions

Journal article

Peer reviewed

Multiple noninteractive zero knowledge proofs under general assumptions

Uriel Feige, D Lapidot and Adi Shamir

SIAM Journal on Computing, Vol.29(1), pp.1-28

Sep/1999

DOI: https://doi.org/10.1137/S0097539792230010

Files and links (2)

url

https://doi.org/10.1137/S0097539792230010View

Published (Version of record) Restricted

url

https://ezproxy.weizmann.ac.il/login?url=http://dx.doi.org/10.1137/S0097539792230010View

Published (Version of record) Restricted

Abstract

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.

Details

Title: Multiple noninteractive zero knowledge proofs under general assumptions
Creators: Uriel Feige (null) - 972WIS_INST___83
D Lapidot (null)
Adi Shamir (null) - 972WIS_INST___83
Resource Type: Journal article
Publication Details: SIAM Journal on Computing, Vol.29(1), pp.1-28; Sep/1999
Number of pages: 28
Language: English
DOI: https://doi.org/10.1137/S0097539792230010
Record Identifier: 993267679103596

Metrics

20 Record Views

See more details