Skip to main content

1991 | OriginalPaper | Buchkapitel

Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

verfasst von : Dror Lapidot, Adi Shamir

Erschienen in: Advances in Cryptology-CRYPT0’ 90

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

In this paper we construct the first publicly verifiable non-interactive zero-knowledge proof for any NP statement under the general assumption that one way permutations exist. If the prover is polynomially bounded then our scheme is based on the stronger assumption that trapdoor permutations exist. In both cases we assume that P and V have a common random string, and use it to prove a single theorem (which may be chosen as a function of the known string).

Metadaten
Titel
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
verfasst von
Dror Lapidot
Adi Shamir
Copyright-Jahr
1991
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-38424-3_26