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

Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

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

1 Scopus citations

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 languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
EditorsAnne Canteaut, Yuval Ishai
PublisherSpringer
Pages599-619
Number of pages21
ISBN (Print)9783030457266
DOIs
StatePublished - 2020
Event39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2020 - Zagreb, Croatia
Duration: 10 May 202014 May 2020

Publication series

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

Conference

Conference39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2020
Country/TerritoryCroatia
CityZagreb
Period10/05/2014/05/20

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2020.

Keywords

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

Fingerprint

Dive into the research topics of 'Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?'. Together they form a unique fingerprint.

Cite this