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.
Original language | English |
---|---|
Title of host publication | Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings |
Editors | Amos Beimel, Stefan Dziembowski |
Publisher | Springer Verlag |
Pages | 263-285 |
Number of pages | 23 |
ISBN (Print) | 9783030038069 |
DOIs | |
State | Published - 2018 |
Event | 16th Theory of Cryptography Conference, TCC 2018 - Panaji, India Duration: 11 Nov 2018 → 14 Nov 2018 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 11239 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 16th Theory of Cryptography Conference, TCC 2018 |
---|---|
Country/Territory | India |
City | Panaji |
Period | 11/11/18 → 14/11/18 |
Bibliographical note
Publisher Copyright:© International Association for Cryptologic Research 2018.
Keywords
- Black-box constructions
- One-way permutations
- Zero-knowledge arguments