@inproceedings{e974e4cac1fd45d18509e9592ca8850b,

title = "Hiding instances in zero-knowledge proof systems ",

abstract = "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.",

author = "Donald Beaver and Joan Feigenbaum and Victor Shoup",

year = "1991",

doi = "10.1007/3-540-38424-3_24",

language = "English (US)",

isbn = "9783540545088",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "326--338",

editor = "Menezes, {Alfred J.} and Vanstone, {Scott A.}",

booktitle = "Advances in Cryptology – CRYPTO 1990, Proceedings",

note = "10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 ; Conference date: 11-08-1990 Through 15-08-1990",

}