@inproceedings{ed75fa1ce25b404fa69da4f613006477,
title = "One-message zero knowledge and non-malleable commitments",
abstract = "We introduce a new notion of one-message zero-knowledge (1ZK) arguments that satisfy a weak soundness guarantee—the number of false statements that a polynomial-time non-uniform adversary can convince the verifier to accept is not much larger than the size of its non-uniform advice. The zero-knowledge guarantee is given by a simulator that runs in (mildly) super-polynomial time. We construct such 1ZK arguments based on the notion of multi-collision-resistant keyless hash functions, recently introduced by Bitansky, Kalai, and Paneth (STOC 2018). Relying on the constructed 1ZK arguments, subexponentially-secure time-lock puzzles, and other standard assumptions, we construct one-message fully-concurrent non-malleable commitments. This is the first construction that is based on assumptions that do not already incorporate non-malleability, as well as the first based on (subexponentially) falsifiable assumptions.",
author = "Nir Bitansky and Huijia Lin",
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_8",
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 = "209--234",
editor = "Amos Beimel and Stefan Dziembowski",
booktitle = "Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings",
address = "ألمانيا",
}