Randomness-efficient non-interactive zero knowledge

Extended abstract
  • Alfredo De Santis
  • Giovanni Di Crescenzo
  • Pino Persiano
Session 18: Cryptography
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)


The model of Non-Interactive Zero-Knowledge allows to obtain minimal interaction between prover and verifier in a zero-knowledge proof if a public random string is available to both parties. In this paper we investigate upper bounds for the length of the random string for proving one and many statements, obtaining the following results:
  • We show how to prove in non-interactive perfect zero-knowledge any polynomial number of statements using a random string of fixed length, that is, not depending on the number of statements. Previously, such a result was known only in the case of computational zero-knowledge.

  • Under the quadratic residuosity assumption, we show how to prove any NP statement in non-interactive zero-knowledge on a random string of length (nk), where n is the size of the statement and k is the security parameter, which improves the previous best construction by a factor of (k).


Proof System Security Parameter Random String Quadratic Residue Quadratic Character 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Ajtai and A. Wigderson, Deterministic Simulation of Probabilistic Constant Depth Circuits, in Proceedings of STOC 85.Google Scholar
  2. 2.
    M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proof Systems, in Proceedings of FOCS 90.Google Scholar
  3. 3.
    M. Bellare and J. Rompel, Randomness in Interactive Proof Systems, in Proceedings of FOCS 94.Google Scholar
  4. 4.
    M. Bellare and M. Yung, Certifying Cryptographic Tools: the case of Trapdoor Permutations, in Journal of Cryptology, vol. 9, n. 1, pp. 149–166.Google Scholar
  5. 5.
    M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084–1118.CrossRefGoogle Scholar
  6. 6.
    M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, in Proceedings of STOC 88.Google Scholar
  7. 7.
    C. Blundo, A. De Santis, G. Persiano, and U. Vaccaro, On the number of random bits in totally private computations, in Proceedings of ICALP 95.Google Scholar
  8. 8.
    J. Boyar and R. Peralta, Short Discreet Proofs, in Proc. of EUROCRYPT 96.Google Scholar
  9. 9.
    I. Damgaard, Non-interactive circuit-based proofs and non-interactive perfect zero-knowledge with preprocessing, in Proceedings of EUROCRYPT 92.Google Scholar
  10. 10.
    A. De Santis, G. Di Crescenzo, and G. Persiano, Secret Sharing and Perfect Zero-Knowledge, in Proceedings of CRYPTO 93.Google Scholar
  11. 11.
    A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, in Theor. Comp. Sc., Vol. 132, pp. 291–317.Google Scholar
  12. 12.
    A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, in Proceedings of CRYPTO 87.Google Scholar
  13. 13.
    A. De Santis and M. Yung, Cryptographic Applications of the Metaproof and Many-Prover Systems, in Proceedings of CRYPTO 90.Google Scholar
  14. 14.
    G. Di Crescenzo, Recycling Random Bits for Composed Perfect Zero-Knowledge, in Proceedings of EUROCRYPT 95.Google Scholar
  15. 15.
    U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, in Proceedings of FOCS 90.Google Scholar
  16. 16.
    L. Fortnow, The Complexity of Perfect Zero-Knowledge, in Proc. of STOC 87.Google Scholar
  17. 17.
    O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, vol. 38, n. 1, 1991, pp. 691–729.CrossRefGoogle Scholar
  18. 18.
    O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, vol. 7, 1994, pp. 1–32.CrossRefGoogle Scholar
  19. 19.
    S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.Google Scholar
  20. 20.
    R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, in Proceedings of FOCS 89.Google Scholar
  21. 21.
    J. Kilian, On the Complexity of Bounded-interaction and Non-interactive Zero-knowledge Proofs, in Proceedings of FOCS 94.Google Scholar
  22. 22.
    J. Kilian and E. Petrank, An Efficient Zero-knowledge Proof System for NP under General Assumptions, in Electronic Colloquium on Computational Complexity, Technical Report no. TR95-038.Google Scholar
  23. 23.
    R. Impagliazzo, N. Nisan, and A. Wigderson, Pseudorandomness for Network Algorithms, in Proceedings of STOC 94.Google Scholar
  24. 24.
    M. Naor and M. Yung, Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attack, in Proceedings of STOC 90.Google Scholar
  25. 25.
    N. Nisan, Pseudorandom Bits for Constant Depth Circuits, Combinatorica, 11, pp. 63–70, 1991.CrossRefGoogle Scholar
  26. 26.
    N. Nisan, Pseudorandom Sequences for Space Bounded Computations, Combinatorica, 12, pp. 449–461, 1992.CrossRefGoogle Scholar
  27. 27.
    N. Nisan and D. Zuckerman, More deterministic simulation in LOGSPACE, in Proceedings of STOC 93.Google Scholar
  28. 28.
    I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, John Wiley and Sons, 1960, New York.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Alfredo De Santis
    • 1
  • Giovanni Di Crescenzo
    • 2
  • Pino Persiano
    • 1
  1. 1.Dipartimento di Informatica ed ApplicazioniUniversità di SalernoBaronissiItaly
  2. 2.Computer Science and Engineering DepartmentUniversity of California at San DiegoLa JollaUSA

Personalised recommendations