Everything provable is provable in zero-knowledge

Michael Ben-Or; Oded Goldreich; Shafi Goldwasser; Johan Håstad; Joe Kilian; Silvio Micali; Phillip Rogaway

doi:10.1007/0-387-34799-2_4

Everything provable is provable in zero-knowledge

Michael Ben-Or
, Oded Goldreich
, Shafi Goldwasser
, Johan Håstad
, Joe Kilian
, Silvio Micali
, Phillip Rogaway

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

112 Scopus citations

Abstract

Assuming the existence of a secure probabilistic encryption scheme, we show that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof. This result extends the result of Goldreich, Micali and Wigderson, that, under the same assumption, all of NP admits zero-knowledge interactive proofs. Assuming envelopes for bit commitment, we show tht every language that admits an interactive proof admits a perfect zero-knowledge interactive proof.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 1988 - Proceedings
Editors	Shafi Goldwasser
Publisher	Springer Verlag
Pages	37-56
Number of pages	20
ISBN (Print)	9780387971964
DOIs	https://doi.org/10.1007/0-387-34799-2_4
State	Published - 1990
Event	Conference on Theory and Applications of Cryptography, CRYPTO 1988 - Santa Barbara, United States Duration: 21 Aug 1988 → 25 Aug 1988

Publication series

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

Conference

Conference	Conference on Theory and Applications of Cryptography, CRYPTO 1988
Country/Territory	United States
City	Santa Barbara
Period	21/08/88 → 25/08/88

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.

Access to Document

10.1007/0-387-34799-2_4

Cite this

Ben-Or, M., Goldreich, O., Goldwasser, S., Håstad, J., Kilian, J., Micali, S., & Rogaway, P. (1990). Everything provable is provable in zero-knowledge. In S. Goldwasser (Ed.), Advances in Cryptology – CRYPTO 1988 - Proceedings (pp. 37-56). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 403 LNCS). Springer Verlag. https://doi.org/10.1007/0-387-34799-2_4

@inproceedings{ef55b988266e43cdbc860cd989debb84,

title = "Everything provable is provable in zero-knowledge",

abstract = "Assuming the existence of a secure probabilistic encryption scheme, we show that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof. This result extends the result of Goldreich, Micali and Wigderson, that, under the same assumption, all of NP admits zero-knowledge interactive proofs. Assuming envelopes for bit commitment, we show tht every language that admits an interactive proof admits a perfect zero-knowledge interactive proof.",

author = "Michael Ben-Or and Oded Goldreich and Shafi Goldwasser and Johan H{\aa}stad and Joe Kilian and Silvio Micali and Phillip Rogaway",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1990.; Conference on Theory and Applications of Cryptography, CRYPTO 1988 ; Conference date: 21-08-1988 Through 25-08-1988",

year = "1990",

doi = "10.1007/0-387-34799-2\_4",

language = "אנגלית",

isbn = "9780387971964",

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

publisher = "Springer Verlag",

pages = "37--56",

editor = "Shafi Goldwasser",

booktitle = "Advances in Cryptology – CRYPTO 1988 - Proceedings",

address = "גרמניה",

}

Ben-Or, M, Goldreich, O, Goldwasser, S, Håstad, J, Kilian, J, Micali, S & Rogaway, P 1990, Everything provable is provable in zero-knowledge. in S Goldwasser (ed.), Advances in Cryptology – CRYPTO 1988 - Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 403 LNCS, Springer Verlag, pp. 37-56, Conference on Theory and Applications of Cryptography, CRYPTO 1988, Santa Barbara, United States, 21/08/88. https://doi.org/10.1007/0-387-34799-2_4

Everything provable is provable in zero-knowledge. / Ben-Or, Michael; Goldreich, Oded; Goldwasser, Shafi et al.
Advances in Cryptology – CRYPTO 1988 - Proceedings. ed. / Shafi Goldwasser. Springer Verlag, 1990. p. 37-56 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 403 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Everything provable is provable in zero-knowledge

AU - Ben-Or, Michael

AU - Goldreich, Oded

AU - Goldwasser, Shafi

AU - Håstad, Johan

AU - Kilian, Joe

AU - Micali, Silvio

AU - Rogaway, Phillip

PY - 1990

Y1 - 1990

N2 - Assuming the existence of a secure probabilistic encryption scheme, we show that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof. This result extends the result of Goldreich, Micali and Wigderson, that, under the same assumption, all of NP admits zero-knowledge interactive proofs. Assuming envelopes for bit commitment, we show tht every language that admits an interactive proof admits a perfect zero-knowledge interactive proof.

AB - Assuming the existence of a secure probabilistic encryption scheme, we show that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof. This result extends the result of Goldreich, Micali and Wigderson, that, under the same assumption, all of NP admits zero-knowledge interactive proofs. Assuming envelopes for bit commitment, we show tht every language that admits an interactive proof admits a perfect zero-knowledge interactive proof.

UR - https://www.scopus.com/pages/publications/85031771268

U2 - 10.1007/0-387-34799-2_4

DO - 10.1007/0-387-34799-2_4

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85031771268

SN - 9780387971964

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

SP - 37

EP - 56

BT - Advances in Cryptology – CRYPTO 1988 - Proceedings

A2 - Goldwasser, Shafi

PB - Springer Verlag

T2 - Conference on Theory and Applications of Cryptography, CRYPTO 1988

Y2 - 21 August 1988 through 25 August 1988

ER -

Ben-Or M, Goldreich O, Goldwasser S, Håstad J, Kilian J, Micali S et al. Everything provable is provable in zero-knowledge. In Goldwasser S, editor, Advances in Cryptology – CRYPTO 1988 - Proceedings. Springer Verlag. 1990. p. 37-56. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/0-387-34799-2_4

Everything provable is provable in zero-knowledge

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this