Cryptology ePrint Archive: Report 2018/912

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations

Carmit Hazay and Muthuramakrishnan Venkitasubramaniam

Abstract: 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.

Category / Keywords: One-way permutations, zero-knowledge arguments, black-box constructions

Original Publication (in the same form): IACR-TCC-2018

Date: received 25 Sep 2018, last revised 26 Sep 2018

Contact author: muthuv at cs rochester edu

Available format(s): PDF | BibTeX Citation

Version: 20180926:131221 (All versions of this report)

Short URL: ia.cr/2018/912


[ Cryptology ePrint archive ]