Paper 2010/483 Original: eprint.iacr.org/2010/483 ↗
Constant-round Non-Malleable Commitments from Any One-Way Function
Abstract
We show \emph{unconditionally} that the existence of commitment schemes implies the existence of \emph{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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2010-09-14: last updated
- 2010-09-14: published
- Short URL
- https://ia.cr/2010/483
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/483,
author = {Huijia Lin and Rafael Pass},
title = {Constant-round Non-Malleable Commitments from Any One-Way Function},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/483},
year = {2010},
url = {https://eprint.iacr.org/2010/483}
}