How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract)

Oded Goldreich; Silvio Micali; Avi Wigderson

doi:10.1007/3-540-47721-7_11

How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract)

Oded Goldreich
, Silvio Micali
, Avi Wigderson

The Rachel and Selim Benin School of Engineering and Computer Science

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

105 Scopus citations

Abstract

Under the assumption that encryption functions exist, we show that all languages in NP possess zero-knowledge proofs. That is, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula. In particular, without yielding neither a satisfying assignment nor weaker properties such as whether there is a satisfying assignment in which x ₁ = TRUE, or whether there is a satisfying assignment in which x ₁ = x ₃ etc. The above result allows us to prove two fundamental theorems in the field of (two-party and multi-party) cryptographic protocols. These theorems yield automatic and efficient transformations that, given a protocol that is correct with respect to an extremely weak adversary, output a protocol correct in the most adversarial scenario. Thus, these theorems imply powerful methodologies for developing two-party and multi-party cryptographic protocols.

Original language	English
Title of host publication	Advances in Cryptology — CRYPTO 1986 - Proceedings
Editors	Andrew M. Odlyzko
Publisher	Springer Verlag
Pages	171-185
Number of pages	15
ISBN (Print)	9783540180470
DOIs	https://doi.org/10.1007/3-540-47721-7_11
State	Published - 1987
Event	Annual International Cryptology Conference, CRYPTO 1986 - Santa Barbara, United States Duration: 11 Aug 1986 → 15 Aug 1986

Publication series

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

Conference

Conference	Annual International Cryptology Conference, CRYPTO 1986
Country/Territory	United States
City	Santa Barbara
Period	11/08/86 → 15/08/86

Bibliographical note

Publisher Copyright:
© 1987, Springer-Verlag Berlin Heidelberg.

Access to Document

10.1007/3-540-47721-7_11

Cite this

Goldreich, O., Micali, S., & Wigderson, A. (1987). How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract). In A. M. Odlyzko (Ed.), Advances in Cryptology — CRYPTO 1986 - Proceedings (pp. 171-185). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 263 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-47721-7_11

Goldreich, Oded ; Micali, Silvio ; Wigderson, Avi. / How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract). Advances in Cryptology — CRYPTO 1986 - Proceedings. editor / Andrew M. Odlyzko. Springer Verlag, 1987. pp. 171-185 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5bbb4c06348b445994f8c58e3c5d5e77,

title = "How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract)",

abstract = "Under the assumption that encryption functions exist, we show that all languages in NP possess zero-knowledge proofs. That is, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula. In particular, without yielding neither a satisfying assignment nor weaker properties such as whether there is a satisfying assignment in which x 1 = TRUE, or whether there is a satisfying assignment in which x 1 = x 3 etc. The above result allows us to prove two fundamental theorems in the field of (two-party and multi-party) cryptographic protocols. These theorems yield automatic and efficient transformations that, given a protocol that is correct with respect to an extremely weak adversary, output a protocol correct in the most adversarial scenario. Thus, these theorems imply powerful methodologies for developing two-party and multi-party cryptographic protocols.",

author = "Oded Goldreich and Silvio Micali and Avi Wigderson",

note = "Publisher Copyright: {\textcopyright} 1987, Springer-Verlag Berlin Heidelberg.; Annual International Cryptology Conference, CRYPTO 1986 ; Conference date: 11-08-1986 Through 15-08-1986",

year = "1987",

doi = "10.1007/3-540-47721-7\_11",

language = "אנגלית",

isbn = "9783540180470",

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

publisher = "Springer Verlag",

pages = "171--185",

editor = "Odlyzko, \{Andrew M.\}",

booktitle = "Advances in Cryptology — CRYPTO 1986 - Proceedings",

address = "גרמניה",

}

Goldreich, O, Micali, S & Wigderson, A 1987, How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract). in AM Odlyzko (ed.), Advances in Cryptology — CRYPTO 1986 - Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 263 LNCS, Springer Verlag, pp. 171-185, Annual International Cryptology Conference, CRYPTO 1986, Santa Barbara, United States, 11/08/86. https://doi.org/10.1007/3-540-47721-7_11

How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract). / Goldreich, Oded; Micali, Silvio; Wigderson, Avi.
Advances in Cryptology — CRYPTO 1986 - Proceedings. ed. / Andrew M. Odlyzko. Springer Verlag, 1987. p. 171-185 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 263 LNCS).

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

TY - GEN

T1 - How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract)

AU - Goldreich, Oded

AU - Micali, Silvio

AU - Wigderson, Avi

PY - 1987

Y1 - 1987

N2 - Under the assumption that encryption functions exist, we show that all languages in NP possess zero-knowledge proofs. That is, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula. In particular, without yielding neither a satisfying assignment nor weaker properties such as whether there is a satisfying assignment in which x 1 = TRUE, or whether there is a satisfying assignment in which x 1 = x 3 etc. The above result allows us to prove two fundamental theorems in the field of (two-party and multi-party) cryptographic protocols. These theorems yield automatic and efficient transformations that, given a protocol that is correct with respect to an extremely weak adversary, output a protocol correct in the most adversarial scenario. Thus, these theorems imply powerful methodologies for developing two-party and multi-party cryptographic protocols.

AB - Under the assumption that encryption functions exist, we show that all languages in NP possess zero-knowledge proofs. That is, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula. In particular, without yielding neither a satisfying assignment nor weaker properties such as whether there is a satisfying assignment in which x 1 = TRUE, or whether there is a satisfying assignment in which x 1 = x 3 etc. The above result allows us to prove two fundamental theorems in the field of (two-party and multi-party) cryptographic protocols. These theorems yield automatic and efficient transformations that, given a protocol that is correct with respect to an extremely weak adversary, output a protocol correct in the most adversarial scenario. Thus, these theorems imply powerful methodologies for developing two-party and multi-party cryptographic protocols.

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

U2 - 10.1007/3-540-47721-7_11

DO - 10.1007/3-540-47721-7_11

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

AN - SCOPUS:85032868051

SN - 9783540180470

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

SP - 171

EP - 185

BT - Advances in Cryptology — CRYPTO 1986 - Proceedings

A2 - Odlyzko, Andrew M.

PB - Springer Verlag

T2 - Annual International Cryptology Conference, CRYPTO 1986

Y2 - 11 August 1986 through 15 August 1986

ER -

Goldreich O, Micali S, Wigderson A. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract). In Odlyzko AM, editor, Advances in Cryptology — CRYPTO 1986 - Proceedings. Springer Verlag. 1987. p. 171-185. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-47721-7_11

How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (Extended Abstract)

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this