Efficient Non-malleable Commitment Schemes

We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly available RSA or Discrete-Log parameters generated by a trusted party. Our protocols require only three rounds and a few modular exponentiations. We also discuss the difference between the notion of non-malleable commitment schemes used by Dolev, Dwork and Naor [DDN00] and the one given by Di Crescenzo, Ishai and Ostrovsky [DIO98].

• Type: Conference
• Year: 2000
• Where: CRYPTO
• Authors: Marc Fischlin, Roger Fischlin
• Keywords: Available Rsa, CRYPTO 2000, Cryptology, Efficient Non-malleable Commitment, Non-malleable Commitment Schemes