TY - GEN
T1 - Round-optimal fully black-box zero-knowledge arguments from one-way permutations
AU - Hazay, Carmit
AU - Venkitasubramaniam, Muthuramakrishnan
N1 - Publisher Copyright: © International Association for Cryptologic Research 2018.
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
KW - Black-box constructions
KW - One-way permutations
KW - Zero-knowledge arguments
UR - https://www.scopus.com/pages/publications/85057094658
U2 - 10.1007/978-3-030-03807-6_10
DO - 10.1007/978-3-030-03807-6_10
M3 - Conference contribution
SN - 9783030038069
T3 - Lecture Notes in Computer Science
SP - 263
EP - 285
BT - Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings
A2 - Beimel, Amos
A2 - Dziembowski, Stefan
PB - Springer Verlag
T2 - 16th International Conference on Theory of Cryptography, TCC 2018
Y2 - 11 November 2018 through 14 November 2018
ER -