Abstract
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).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bellare, and S. Goldwasser, New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero-Knowledge Proofs. CRYPTO 89.
M. Bellare, and S. Micali, Non-Interactive Oblivious Transfer and Applications. CRYPTO 89.
M. Blum, a presentation in the 1986 International Congress of Mathematics.
M. Blum, A. De Santis, S. Micali and G. Persiano, Non-Interactive Zero-Knowledge, Manuscript, December 1989.
M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge Proof Systems and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988.
A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, CRYPTO 87.
A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge with Preprocessing, CRYPTO 88.
U. Feige, D. Lapidot and A. Shamir, Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String. FOCS 90.
U. Feige, and A. Shamir, Zero-Knowledge Proofs of Knowledge in Two Rounds. CRYPTO 89.
O. Goldreich, L.A. Levin, A Hard-Core Predicate for all One-Way Functions. STOC 89.
O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing But Their Validity and a Methodology of Cryptographic Protocol Design. Proc. 27th FOCS, 1986.
S. Goldwasser, and S. Micali Probabilistic Encryption, Journal of Computer and System Sciences 28, 1984
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proofs. STOC 85.
J. Kilian, S. Micali, and R. Ostrovsky, Minimum Resource Zero-Knowledge Proofs., FOCS 89.
M. Naor, M. Yung, Public-key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks, Proc. of STOC 90.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lapidot, D., Shamir, A. (1991). Publicly Verifiable Non-Interactive Zero-Knowledge Proofs. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive