Hiding instances in zero-knowledge proof systems

Donald Beaver, Joan Feigenbaum, Victor Shoup

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

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.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology – CRYPTO 1990, Proceedings
PublisherSpringer Verlag
Pages326-338
Number of pages13
Volume537 LNCS
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

Other

Other10th Conference on the Theory and Application of Cryptography, CRYPTO 1990
CountryUnited States
CitySanta Barbara
Period8/11/908/15/90

Fingerprint

Zero-knowledge Proof
Zero-knowledge
Proof System
Boolean functions
Boolean Functions
Characteristic Function
Polynomial time
Polynomials
If and only if
Network protocols
Language

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Beaver, D., Feigenbaum, J., & Shoup, V. (1991). Hiding instances in zero-knowledge proof systems . In Advances in Cryptology – CRYPTO 1990, Proceedings (Vol. 537 LNCS, pp. 326-338). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 537 LNCS). Springer Verlag.

Hiding instances in zero-knowledge proof systems . / Beaver, Donald; Feigenbaum, Joan; Shoup, Victor.

Advances in Cryptology – CRYPTO 1990, Proceedings. Vol. 537 LNCS Springer Verlag, 1991. p. 326-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 537 LNCS).

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

Beaver, D, Feigenbaum, J & Shoup, V 1991, Hiding instances in zero-knowledge proof systems . in Advances in Cryptology – CRYPTO 1990, Proceedings. vol. 537 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 537 LNCS, Springer Verlag, pp. 326-338, 10th Conference on the Theory and Application of Cryptography, CRYPTO 1990, Santa Barbara, United States, 8/11/90.
Beaver D, Feigenbaum J, Shoup V. Hiding instances in zero-knowledge proof systems . In Advances in Cryptology – CRYPTO 1990, Proceedings. Vol. 537 LNCS. Springer Verlag. 1991. p. 326-338. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Beaver, Donald ; Feigenbaum, Joan ; Shoup, Victor. / Hiding instances in zero-knowledge proof systems . Advances in Cryptology – CRYPTO 1990, Proceedings. Vol. 537 LNCS Springer Verlag, 1991. pp. 326-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
language = "English (US)",
isbn = "9783540545088",
volume = "537 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "326--338",
booktitle = "Advances in Cryptology – CRYPTO 1990, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Hiding instances in zero-knowledge proof systems

AU - Beaver, Donald

AU - Feigenbaum, Joan

AU - Shoup, Victor

PY - 1991

Y1 - 1991

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

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

UR - http://www.scopus.com/inward/record.url?scp=84958948483&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958948483&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540545088

VL - 537 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 326

EP - 338

BT - Advances in Cryptology – CRYPTO 1990, Proceedings

PB - Springer Verlag

ER -