Abstract
Informally speaking, an instance-hiding proof system for the function f is a protocol in which a polynomial-time verifier is convinced of the value of f(x) but does not reveal the input x to the provers. We show here that a boolean function f has an instance-hiding proof system if and only if it is the characteristic function of a language in NEXP ∩ coNEXP. We formalize the notion of zero-knowledge for instance-hiding proof systems with several provers and show that all such systems can be made perfect zero-knowledge.
Work done at Harvard University, supported in part by NSF grant CCR-870-4513.
Work done at AT&T Bell Laboratories as a Postdoctoral Fellow in Theoretical Computer Science.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21–50.
L. Babai, L. Fortnow, and C. Lund. Nondeterministic Exponential Time has Two-Prover Interactive Protocols, Proc. of the 31st FOCS (1990), IEEE.
D. Barrington. Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC 1, J. Comput. System Sci. 38 (1989), 150–164.
D. Beaver and J. Feigenbaum. Hiding Instances in Multioracle Queries, Proc. of the 7th STACS (1990), Springer Verlag LNCS 415, 37–48.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with Low Communication Overhead, these proceedings.
D. Beaver, J. Feigenbaum, and V. Shoup. Hiding Instances in Zero-Knowledge Proof Systems, AT&T Bell Laboratories Technical Memorandum, April 12, 1990.
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multiprover Interactive Proof Systems: How to Remove Intractability Assumptions, Proc. of the 20th STOC (1988), ACM, 113–131.
M. Ben-Or, O. Goldreich, S. Goldwasser, J. Håstad, J. Kilian, S. Micali, and P. Rogaway. Everything Provable is Provable in Zero-Knowledge, Proc. of the 8th CRYPTO (1988), Springer Verlag LNCS 403, 37–56.
M. Blum, M. Luby, and R. Rubinfeld. Program Result Checking Against Adaptive Programs and in Cryptographic Settings, Proc. of the DIMACS Workshop on Distributed Computing and Cryptography (1989), AMS.
L. Fortnow, J. Rompel, and M. Sipser. On the Power of Multiprover Interactive Protocols, Proc. of the 3rd Structure in Complexity Theory Conference (1988), IEEE, 156–161.
Z. Galil, S. Haber, and M. Yung. Minimum-Knowledge Interactive Proofs for Decision Problems, SIAM J. Comput. 18 (1989), 711–739.
S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186–208.
J. Kilian. Founding Cryptography on Oblivious Transfer, Proc. of 20th STOC (1988), ACM, 20–31.
C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic Methods for Interactive Proof Systems, Proc. of the 31st FOCS (1990), IEEE.
R. Rivest. Workshop on Communication and Computing, MIT, October, 1986.
A. Shamir. IP = PSPACE, Proc. of the 31st FOCS (1990), IEEE.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaver, D., Feigenbaum, J., Shoup, V. (1991). Hiding Instances in Zero-Knowledge Proof Systems. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_24
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive