Abstract
Non-Interactive Zero-Knowledge Proof Systems have been proven to exist under a specific complexity assumption; namely, under the Quadratic Residuosity Assumption which gives rise to a specific secure probabilistic encryption scheme.
In this paper we prove that the existence of any secure probabilistic encryption scheme, actually any one-way encryption scheme, is enough for Non-Interactive Zero-Knowledge in a modified model. That is, we show that the ability to prove a randomly chosen theorem allows to subsequently prove non-interactively and in Zero-Knowledge any smaller size theorem whose proof is discovered.
Work done at IBM while on leave from Dipartimento di Informatica ed Applicazioni, Universita di Salerno, 84100 Salerno, Italy.
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. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero-Knowledge, CRYPTO 88.
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, Chicago, Illinois, 1988, pp. 103–112.
M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo random bits, SIAM Journal on Computing, vol. 13, n. 4, November 1984, pp. 850–864.
A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, in “Advances in Cryptology-CRYPTO 87 Proceedings”, pp. 52–72, vol. 293 of “Lecture Notes in Computer Science”, Springer Verlag.
S. Goldwasser and S. Micali, Probabilistic Encryption, Journal of Computer and System Science, vol. 28, n. 2, 1984, pp. 270–299.
S. Goldwasser, S. Micali and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attack, SIAM Journal on Computing, vol. 17, n. 2, April 1988, pp. 281–308.
M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979.
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, RI, May 1985, pp. 291–304.
O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proceedings of the 27th Annual Symposium on Foundations of Computer Science, October 1986, pp. 174–187.
S. Micali, C. Rackoff, and B. Sloan, The Notion of Security for Probabilistic Cryptosystems, SIAM Journal on Computing, vol. 17, n. 2, April 1988, pp. 412–426.
C. E. Shannon, Communication Theory of Secrecy Systems, Bell System Tech. J. vol. 28 Oct. 1949 pp. 656–715.
A. C. Yao, Theory and Applications of Trapdoor Functions, Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science, 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Santis, A., Micali, S., Persiano, G. (1990). Non-Interactive Zero-Knowledge with Preprocessing. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_21
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_21
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive