Computational and statistical indistinguishabilities

  • Kaoru Kurosawa
  • Osamu Watanabe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)


We prove that a pair of polynomially samplable distributions are statistically indistinguishable if and only if no polynomial size circuits relative to NP sets (P nu NP -distinguishers) can tell them apart. As one application of this observation, we classify “zero-knowledge” notions that are used for interactive systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BP92]
    M. Bellare and E. Petrank, Making zero-knowledge provers efficient, in Proc. 24th ACM Sympos. on Theory of Computing, ACM (1992), 711–722.Google Scholar
  2. [FFS87]
    U. Feige, A. Fiat, and A. Shamir, Zero-knowledge proofs of identity, in Proc. 19th ACM Sympos. on Theory of Computing, ACM (1987), 210–217.Google Scholar
  3. [Gav92]
    R. Gavaldà, Bounding the complexity of advice functions, in Proc. 7th Structure in Complexity Theory Conference, IEEE (1992), 249–254.Google Scholar
  4. [Gol90]
    O. Goldreich, A note on computational indistinguishability, Inform. Process. Lett., 34 (1990), 277–281.Google Scholar
  5. [GMR89]
    S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal of Computing, 18 (6) (1989), 186–208.CrossRefGoogle Scholar
  6. [ILL89]
    R. Impagliazzo, L. Levin, and M. Luby, Pseudorandom generation from one-way functions, in Proc. 21st ACM Sympos. on Theory of Computing, ACM (1989), 12–24.Google Scholar
  7. [Sip83]
    M. Sipser, A complexity theoretic approach to randomness, in Proc. 15th ACM Sympos. on Theory of Computing, ACM (1983), 330–335.Google Scholar
  8. [TW87]
    M. Tompa and H. Woll, Random self-reducibility and zero-knowledge interactive proofs of possession of information, in Proc. 28th IEEE Sympos. on Foundations of Computer Science, IEEE (1987), 472–482.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Kaoru Kurosawa
    • 1
  • Osamu Watanabe
    • 2
  1. 1.Dept. of Electrical & Electronic Eng.Tokyo Institute of TechnologyTokyoJapan
  2. 2.Dept. of Computer ScienceTokyo Institute of TechnologyTokyoJapan

Personalised recommendations