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.
CITATION STYLE
Hazay, C., & Venkitasubramaniam, M. (2018). Round-optimal fully black-box zero-knowledge arguments from one-way permutations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11239 LNCS, pp. 263–285). Springer Verlag. https://doi.org/10.1007/978-3-030-03807-6_10
Mendeley helps you to discover research relevant for your work.