Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin
2009 Journal of Cryptology  
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] .
doi:10.1007/s00145-009-9045-2 fatcat:lhomi6esuja7rayqelwekvihau