Advertisement

On Constant-Round Precise Zero-Knowledge

  • Ning Ding
  • Dawu Gu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7618)

Abstract

Precise zero-knowledge, introduced by Micali and Pass [STOC’06], captures the idea that a view of any verifier can be indifferently reconstructed. Though there are some constructions of precise zero-knowledge, constant-round constructions are unknown to exist. This paper is towards constant-round constructions of precise zero-knowledge. The results of this paper are as follows.

  • We propose a relaxation of precise zero-knowledge that captures the idea that with a probability arbitrarily polynomially close to 1 a view of any verifier can be indifferently reconstructed, i.e., there exists a simulator (without having q(n),p(n,t) as input) such that for any polynomial q(n), there is a polynomial p(n,t) satisfying with probability at least \(1-\frac{1}{q(n)}\), the view of any verifier in every interaction can be reconstructed in p(n,T) time by the simulator whenever the verifier’s running-time on this view is T. Then we show the impossibility of constructing constant-round protocols satisfying our relaxed definition with all the known techniques.

  • We present a constant-round precise zero-knowledge argument for any language in NP with respect to our definition, assuming the existence of collision-resistant hash function families (against all n O(loglogn)-size circuits).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106–115 (2001)Google Scholar
  2. 2.
    Barak, B., Goldreich, O.: Universal arguments and their applications. In: IEEE Conference on Computational Complexity, pp. 194–203 (2002)Google Scholar
  3. 3.
    Ding, N., Gu, D.: Precise Time and Space Simulatable Zero-Knowledge. In: Boyen, X., Chen, X. (eds.) ProvSec 2011. LNCS, vol. 6980, pp. 16–33. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  4. 4.
    Goldreich, O., Micali, S.: Increasing the expansion of pseudorandom generators (1996), http://www.wisdom.weizmann.ac.il/oded/papers.html
  5. 5.
    Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431–473 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Micali, S., Pass, R.: Local zero knowledge. In: Kleinberg, J.M. (ed.) STOC, pp. 306–315. ACM (2006)Google Scholar
  8. 8.
    Pass, R.: A precise computational approach to knowledge. Tech. rep., Ph. D. thesis, MIT. Available (2006)Google Scholar
  9. 9.
    Pippenger, N., Fischer, M.J.: Relations among complexity measures. J. ACM 26(2), 361–381 (1979)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ning Ding
    • 1
  • Dawu Gu
    • 1
  1. 1.Department of Computer Science and EngineeringShanghai Jiao Tong UniversityChina

Personalised recommendations