Skip to main content
SpringerLink
Log in

Computational and statistical indistinguishabilities

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 650))

Included in the following conference series:

Abstract

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 NPnu -distinguishers) can tell them apart. As one application of this observation, we classify “zero-knowledge” notions that are used for interactive systems.

The second author was supported in part by Grant in Aid for Scientific Research of the Ministry of Education, Science and Culture of Japan under Grant-in-Aid for Research (A) 04780027 (1992).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. R. Gavaldà, Bounding the complexity of advice functions, in Proc. 7th Structure in Complexity Theory Conference, IEEE (1992), 249–254.

    Google Scholar 

  4. O. Goldreich, A note on computational indistinguishability, Inform. Process. Lett., 34 (1990), 277–281.

    Google Scholar 

  5. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal of Computing, 18 (6) (1989), 186–208.

    Article  Google Scholar 

  6. 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. M. Sipser, A complexity theoretic approach to randomness, in Proc. 15th ACM Sympos. on Theory of Computing, ACM (1983), 330–335.

    Google Scholar 

  8. 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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical & Electronic Eng., Tokyo Institute of Technology, Meguro-ku Ookayama, 152, Tokyo, Japan

    Kaoru Kurosawa

  2. Dept. of Computer Science, Tokyo Institute of Technology, Meguro-ku Ookayama, 152, Tokyo, Japan

    Osamu Watanabe

Authors
  1. Kaoru Kurosawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Osamu Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Toshihide Ibaraki Yasuyoshi Inagaki Kazuo Iwama Takao Nishizeki Masafumi Yamashita

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurosawa, K., Watanabe, O. (1992). Computational and statistical indistinguishabilities. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_95

Download citation

  • DOI: https://doi.org/10.1007/3-540-56279-6_95

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56279-5

  • Online ISBN: 978-3-540-47501-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation