Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- Cite this paper as:
- Pass R., Wee H. (2010) Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. In: Gilbert H. (eds) Advances in Cryptology – EUROCRYPT 2010. EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, Heidelberg
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a black-box proof of security. As far as we know, this is the first construction of a constant-round non-malleable protocol based on only one-wayness, or to admit a black-box proof of security under any standard-type assumption.