Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions [chapter]

Rafael Pass, Hoeteck Wee
2010 Lecture Notes in Computer Science  
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox 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.
doi:10.1007/978-3-642-13190-5_32 fatcat:t52rglicxnaetlku4lybxfzunu