Non-Interactive Zero-Knowledge with Preprocessing

  • Alfredo De Santis
  • Siluio Micali
  • Giuseppe Persiano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 403)


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.


Encryption Scheme Proof System Language Versus Truth Assignment Random String 
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.


  1. [BGGHKMR]
    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.Google Scholar
  2. [BlFeMi]
    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.Google Scholar
  3. [BlMi]
    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.CrossRefzbMATHMathSciNetGoogle Scholar
  4. [DeMiPe]
    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.Google Scholar
  5. [GoMi]
    S. Goldwasser and S. Micali, Probabilistic Encryption, Journal of Computer and System Science, vol. 28, n. 2, 1984, pp. 270–299.CrossRefzbMATHMathSciNetGoogle Scholar
  6. [GoMiRi]
    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.CrossRefzbMATHMathSciNetGoogle Scholar
  7. [GaJo]
    M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979.zbMATHGoogle Scholar
  8. [GoMiRa]
    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.Google Scholar
  9. [GoMiWi]
    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.Google Scholar
  10. [MiRaSl]
    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.CrossRefzbMATHMathSciNetGoogle Scholar
  11. [Sh]
    C. E. Shannon, Communication Theory of Secrecy Systems, Bell System Tech. J. vol. 28 Oct. 1949 pp. 656–715.MathSciNetGoogle Scholar
  12. [Ya]
    A. C. Yao, Theory and Applications of Trapdoor Functions, Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science, 1982, pp. 80–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Alfredo De Santis
    • 1
  • Siluio Micali
    • 2
  • Giuseppe Persiano
    • 3
  1. 1.IBM T. J. Watson Research CenterYorktown Heights
  2. 2.Laboratory for Computer ScienceMITCambridge
  3. 3.Aiken Comp. Lab.Harvard UniversityCambridge

Personalised recommendations