## CryptoDB

### Paper: Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations

Authors: Carmit Hazay Muthuramakrishnan Venkitasubramaniam DOI: 10.1007/978-3-030-03807-6_10 Search ePrint Search Google TCC 2018 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 $\textsf {NP}$ 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 $\textsf {NP}$ 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.
##### BibTeX
@inproceedings{tcc-2018-28987,
title={Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations},
booktitle={Theory of Cryptography},
series={Theory of Cryptography},
publisher={Springer},
volume={11239},
pages={263-285},
doi={10.1007/978-3-030-03807-6_10},
author={Carmit Hazay and Muthuramakrishnan Venkitasubramaniam},
year=2018
}