Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?

Carmit Hazay; Rafael Pass; Muthuramakrishnan Venkitasubramaniam

doi:10.1007/978-3-030-45727-3_20

Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?

Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Bar-Ilan University

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

Abstract

We prove that if a language L has a 4-round fully black-box zero-knowledge argument with negligible soundness based on one-way functions, then (Formula presented). Since (Formula presented) implies that the polynomial hierarchy collapses, our result implies that NP-complete languages are unlikely to have 4-round fully black-box zero-knowledge arguments based on one-way functions. In TCC 2018, Hazay and Venkitasubramaniam, and Khurana, Ostrovsky, and Srinivasan demonstrated 4-round fully black-box zero-knowledge arguments for all languages in NP based on injective one-way functions. Their results also imply a 5-round protocol based on one-way functions. In essence, our result resolves the round complexity of fully black-box zero-knowledge arguments based on one-way functions.

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Editors	Anne Canteaut, Yuval Ishai
Pages	599-619
Number of pages	21
DOIs	https://doi.org/10.1007/978-3-030-45727-3_20
State	Published - 2020
Event	39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2020 - Zagreb, Croatia Duration: 10 May 2020 → 14 May 2020

Publication series

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

Conference

Conference	39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2020
Country/Territory	Croatia
City	Zagreb
Period	10/05/20 → 14/05/20

Keywords

Black-box constructions
One-way functions
Zero-knowledge arguments

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-45727-3_20

Cite this

Hazay, C., Pass, R., & Venkitasubramaniam, M. (2020). Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? In A. Canteaut, & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 599-619). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12107 LNCS). https://doi.org/10.1007/978-3-030-45727-3_20

Hazay, Carmit ; Pass, Rafael ; Venkitasubramaniam, Muthuramakrishnan. / Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?. Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. editor / Anne Canteaut ; Yuval Ishai. 2020. pp. 599-619 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0dcd3235571641e682d3927493df8227,

title = "Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?",

abstract = "We prove that if a language L has a 4-round fully black-box zero-knowledge argument with negligible soundness based on one-way functions, then (Formula presented). Since (Formula presented) implies that the polynomial hierarchy collapses, our result implies that NP-complete languages are unlikely to have 4-round fully black-box zero-knowledge arguments based on one-way functions. In TCC 2018, Hazay and Venkitasubramaniam, and Khurana, Ostrovsky, and Srinivasan demonstrated 4-round fully black-box zero-knowledge arguments for all languages in NP based on injective one-way functions. Their results also imply a 5-round protocol based on one-way functions. In essence, our result resolves the round complexity of fully black-box zero-knowledge arguments based on one-way functions.",

keywords = "Black-box constructions, One-way functions, Zero-knowledge arguments",

author = "Carmit Hazay and Rafael Pass and Muthuramakrishnan Venkitasubramaniam",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2020.; 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2020 ; Conference date: 10-05-2020 Through 14-05-2020",

year = "2020",

doi = "10.1007/978-3-030-45727-3_20",

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

isbn = "9783030457266",

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

pages = "599--619",

editor = "Anne Canteaut and Yuval Ishai",

booktitle = "Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings",

}

Hazay, C , Pass, R & Venkitasubramaniam, M 2020, Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? in A Canteaut & Y Ishai (eds), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12107 LNCS, pp. 599-619, 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2020, Zagreb, Croatia, 10/05/20. https://doi.org/10.1007/978-3-030-45727-3_20

Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? / Hazay, Carmit ; Pass, Rafael; Venkitasubramaniam, Muthuramakrishnan.
Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. ed. / Anne Canteaut; Yuval Ishai. 2020. p. 599-619 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12107 LNCS).

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