Non-Interactive and Non-Malleable Commitment

A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many settings the implementation of this fundamental primitive requires a strong non-malleability propertyin order not to be susceptibleto a certain class of attacks. In this paper, assuming that a common random string is available to all players, we show how to implement nonmalleable commitment without any interaction and based on any one-way function. In contrast, all previous solutions required either logarithmically many rounds of interaction or strong algebraic assumptions.

• Type: Conference
• Year: 1998
• Where: STOC
• Authors: Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
• Keywords: Algorithms, Buildingblock Throughoutmodern Cryptography, STOC 1998, Strong Algebraic Assumptions, Strong Non-malleability Propertyin