@inproceedings{6ac255900daf4df58571f2229118f446,
title = "Round-optimal fully black-box zero-knowledge arguments from one-way permutations",
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.",
keywords = "Black-box constructions, One-way permutations, Zero-knowledge arguments",
author = "Carmit Hazay and Muthuramakrishnan Venkitasubramaniam",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2018.; 16th Theory of Cryptography Conference, TCC 2018 ; Conference date: 11-11-2018 Through 14-11-2018",
year = "2018",
doi = "10.1007/978-3-030-03807-6_10",
language = "الإنجليزيّة",
isbn = "9783030038069",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "263--285",
editor = "Amos Beimel and Stefan Dziembowski",
booktitle = "Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings",
address = "ألمانيا",
}