Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art

Oded Goldreich

doi:10.1007/978-3-642-22670-0_28

Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art

Oded Goldreich

Department of Computer Science and Applied Mathematics

Weizmann Institute of Science

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

Abstract

The purpose of this article is to correct the inaccurate account of this subject that is provided in our two-volume work Foundation of Cryptography. Specifically, as pointed out by Jonathan Katz, it seems that the construction of Non-Interactive Zero-Knowledge proofs for NP requires the existence of a doubly-enhanced collection of trapdoor permutations (to be defined below). We stress that the popular candidate collections of trapdoor permutations do satisfy this doubly-enhanced condition. In fact, any collection of trapdoor permutations that has dense and easily recognizable domain satisfies this condition.

Original language	English
Title of host publication	Studies in Complexity and Cryptography
Subtitle of host publication	Miscellanea on the Interplay between Randomness and Computation
Editors	Oded Goldreich
Chapter	28
Pages	406-421
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-22670-0_28
State	Published - 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6650 LNCS

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-22670-0_28

Cite this

Goldreich, O. (2011). Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art. In O. Goldreich (Ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation (pp. 406-421). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS). https://doi.org/10.1007/978-3-642-22670-0_28

Goldreich, Oded. / Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations : The state of the art. Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. editor / Oded Goldreich. 2011. pp. 406-421 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{32474ffff1f345e198dd5d01662f364a,

title = "Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art",

abstract = "The purpose of this article is to correct the inaccurate account of this subject that is provided in our two-volume work Foundation of Cryptography. Specifically, as pointed out by Jonathan Katz, it seems that the construction of Non-Interactive Zero-Knowledge proofs for NP requires the existence of a doubly-enhanced collection of trapdoor permutations (to be defined below). We stress that the popular candidate collections of trapdoor permutations do satisfy this doubly-enhanced condition. In fact, any collection of trapdoor permutations that has dense and easily recognizable domain satisfies this condition.",

author = "Oded Goldreich",

year = "2011",

doi = "10.1007/978-3-642-22670-0_28",

language = "الإنجليزيّة",

isbn = "9783642226694",

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

pages = "406--421",

editor = "Oded Goldreich",

booktitle = "Studies in Complexity and Cryptography",

}

Goldreich, O 2011, Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art. in O Goldreich (ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6650 LNCS, pp. 406-421. https://doi.org/10.1007/978-3-642-22670-0_28

Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art. / Goldreich, Oded.
Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. ed. / Oded Goldreich. 2011. p. 406-421 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS).

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

TY - CHAP

T1 - Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations

T2 - The state of the art

AU - Goldreich, Oded

PY - 2011

Y1 - 2011

N2 - The purpose of this article is to correct the inaccurate account of this subject that is provided in our two-volume work Foundation of Cryptography. Specifically, as pointed out by Jonathan Katz, it seems that the construction of Non-Interactive Zero-Knowledge proofs for NP requires the existence of a doubly-enhanced collection of trapdoor permutations (to be defined below). We stress that the popular candidate collections of trapdoor permutations do satisfy this doubly-enhanced condition. In fact, any collection of trapdoor permutations that has dense and easily recognizable domain satisfies this condition.

AB - The purpose of this article is to correct the inaccurate account of this subject that is provided in our two-volume work Foundation of Cryptography. Specifically, as pointed out by Jonathan Katz, it seems that the construction of Non-Interactive Zero-Knowledge proofs for NP requires the existence of a doubly-enhanced collection of trapdoor permutations (to be defined below). We stress that the popular candidate collections of trapdoor permutations do satisfy this doubly-enhanced condition. In fact, any collection of trapdoor permutations that has dense and easily recognizable domain satisfies this condition.

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

U2 - 10.1007/978-3-642-22670-0_28

DO - 10.1007/978-3-642-22670-0_28

M3 - فصل

SN - 9783642226694

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

SP - 406

EP - 421

BT - Studies in Complexity and Cryptography

A2 - Goldreich, Oded

ER -

Goldreich O. Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art. In Goldreich O, editor, Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. 2011. p. 406-421. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-22670-0_28

Basing non-interactive zero-knowledge on (Enhanced) trapdoor permutations: The state of the art

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this