Skip to main content
SpringerLink
Log in

A note on one-prover, instance-hiding zero-knowledge proof systems

Extended abstract

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT '91 (ASIACRYPT 1991)

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

Included in the following conference series:

Abstract

In this note we study two cryptographic notions introduced in recent years: zero-knowledge proof systems [GMR] and instance-hiding schemes [AFK]. Addressing an open problem of [BFS] and extending the work in [AFK], we show that, if one-way permutations exist, the following two statements are equivalent for any function f:

  1. (i)

    f has a one-prover, instance-hiding, zero-knowledge proof system.

  2. (ii)

    f is computable in polynomial space and has an instance-hiding scheme that leaks at most the length of the input.

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. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21–50.

    Article  Google Scholar 

  2. D. Beaver, J. Feigenbaum, and V. Shoup. Hiding Instances in Zero-Knowledge Proof Systems, Proc. of the 10th CRYPTO (Santa Barbara, CA; August, 1990), Springer Verlag LNCS 537, 1991, 326–338.

    Google Scholar 

  3. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186–208.

    Article  Google Scholar 

  4. S. Goldreich, S. Micali and A. Wigderson. How to Play ANY Mental Game, Proc. of the 19th STOC (New York, NY; May, 1987), ACM, 218–229.

    Google Scholar 

  5. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic Methods for Interactive Proof Systems, Proc. of the 31st FOCS (St. Louis, MO; October, 1990), IEEE, 2–10.

    Google Scholar 

  6. R. Ostrovsky, R. Venkatesan, and M. Yung. Fair Games Against an All-Powerful Adversary, Proc. of SEQUENCES '91 (Positano, Italy; June, 1991).

    Google Scholar 

  7. A. Shamir. IP = PSPACE, Proc. of the 31st FOCS (St. Louis, MO; October, 1990), IEEE, 11–15.

    Google Scholar 

  8. A. C. Yao. How to Generate and Exchange Secrets, Proc. of the 27th FOCS (Toronto, Ontario; October, 1986), IEEE, 162–167.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Labs, Rm 2C473, 600 Mountain Avenue, 07974-0636, Murray Hill, NJ

    Joan Feigenbaum

  2. MIT Lab for Computer Science, 545 Technology Square, 02139, Cambridge, MA

    Rafail Ostrovsky

Authors
  1. Joan Feigenbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rafail Ostrovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feigenbaum, J., Ostrovsky, R. (1993). A note on one-prover, instance-hiding zero-knowledge proof systems. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation