Welcome to the resource topic for 2018/912
Title:
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
Authors: Carmit Hazay, 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.
ePrint: https://eprint.iacr.org/2018/912
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .