@inproceedings{a440cebcd8fe455d88b96f6e05956e66,
title = "Constant-round non-malleable commitments from any one-way function",
abstract = "We show unconditionally that the existence of commitment schemes implies the existence of constant-round non-malleable commitments; earlier protocols required additional assumptions such as collision resistant hash functions or subexponential one-way functions. Our protocol also satisfies the stronger notions of concurrent non-malleability and robustness. As a corollary, we establish that constant-round non-malleable zero-knowledge arguments for NP can be based on one-way functions and constant-round secure multi-party computation can be based on enhanced trapdoor permutations; also here, earlier protocols additionally required either collision-resistant hash functions or subexponential one-way functions.",
keywords = "commitments, constant-round protocols, cryptography, non-malleability",
author = "Huijia Lin and Rafael Pass",
year = "2011",
doi = "10.1145/1993636.1993730",
language = "الإنجليزيّة",
isbn = "9781450306911",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "705--714",
booktitle = "STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing",
address = "الولايات المتّحدة",
note = "43rd ACM Symposium on Theory of Computing, STOC 2011 ; Conference date: 06-06-2011 Through 08-06-2011",
}