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

Carmit Hazay; Muthuramakrishnan Venkitasubramaniam

Paper 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.

Metadata

Available format(s): PDF
Publication info: Published by the IACR in TCC 2018
Keywords: One-way permutations zero-knowledge arguments black-box constructions
Contact author(s): muthuv @ cs rochester edu
History: 2018-09-26: revised; 2018-09-25: received; See all versions
Short URL: https://ia.cr/2018/912
License: CC BY

BibTeX

@misc{cryptoeprint:2018/912,
      author = {Carmit Hazay and Muthuramakrishnan Venkitasubramaniam},
      title = {Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/912},
      year = {2018},
      url = {https://eprint.iacr.org/2018/912}
}