Hiding instances in zero-knowledge proof systems

Donald Beaver, Joan Feigenbaum, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Informally speaking, an instance-hiding pruoj system for the function f is a protocol in which a polynomial-time verifier is convinced of the value of f(z) but does not reveal the input z 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 alI such systems can be made perfect zero-knowledge.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology – CRYPTO 1990, Proceedings
EditorsAlfred J. Menezes, Scott A. Vanstone
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540545088
StatePublished - 1991
Event10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 - Santa Barbara, United States
Duration: Aug 11 1990Aug 15 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume537 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other10th Conference on the Theory and Application of Cryptography, CRYPTO 1990
Country/TerritoryUnited States
CitySanta Barbara

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Hiding instances in zero-knowledge proof systems'. Together they form a unique fingerprint.

Cite this