Abstract
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].
Cite
CITATION STYLE
Fischlin, M., & Fischlin, R. (2000). Efficient non-malleable commitment schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1880, pp. 413–431). Springer Verlag. https://doi.org/10.1007/3-540-44598-6_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
