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

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. Keywords. commitment schemes, non-malleability, complexity leveraging

• Type: Conference
• Year: 2010
• Where: EUROCRYPT
• Authors: Rafael Pass, Hoeteck Wee
• Keywords: Commitment Schemes, Cryptology, EUROCRYPT 2010, Non-malleable Commitment Scheme, Sub-exponential One-way Functions