Round-optimal fully black-box zero-knowledge arguments from one-way permutations

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

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

5 Scopus citations


In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for any language in NP, based on injective one-way functions, that makes black-box use of the underlying function. As a corollary, we also obtain the first 4-round perfect zero-knowledge argument for NP based on claw-free permutations via a black-box construction and 4-round input-delayed commit-and-prove zero-knowledge argument based on injective one-way functions.

Original languageEnglish
Title of host publicationTheory of Cryptography - 16th International Conference, TCC 2018, Proceedings
EditorsAmos Beimel, Stefan Dziembowski
PublisherSpringer Verlag
Number of pages23
ISBN (Print)9783030038069
StatePublished - 2018
Event16th Theory of Cryptography Conference, TCC 2018 - Panaji, India
Duration: 11 Nov 201814 Nov 2018

Publication series

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


Conference16th Theory of Cryptography Conference, TCC 2018

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2018.


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


Dive into the research topics of 'Round-optimal fully black-box zero-knowledge arguments from one-way permutations'. Together they form a unique fingerprint.

Cite this