Everything provable is provable in zero-knowledge

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

96 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 languageAmerican English
Title of host publicationAdvances in Cryptology – CRYPTO 1988 - Proceedings
EditorsShafi Goldwasser
PublisherSpringer Verlag
Pages37-56
Number of pages20
ISBN (Print)9780387971964
DOIs
StatePublished - 1990
EventConference on Theory and Applications of Cryptography, CRYPTO 1988 - Santa Barbara, United States
Duration: 21 Aug 198825 Aug 1988

Publication series

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

Conference

ConferenceConference on Theory and Applications of Cryptography, CRYPTO 1988
Country/TerritoryUnited States
CitySanta Barbara
Period21/08/8825/08/88

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1990.

Fingerprint

Dive into the research topics of 'Everything provable is provable in zero-knowledge'. Together they form a unique fingerprint.

Cite this