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].

Download full text files

Export metadata

Author:Marc Fischlin, Roger Fischlin
Editor:Mihir Bellare
Document Type:Preprint
Year of Completion:2000
Year of first Publication:2000
Publishing Institution:Universit├Ątsbibliothek Johann Christian Senckenberg
Release Date:2005/07/20
Tag:Chinese Remainder Theorem; Commitment Scheme; Discrete Logarithm; Noticeable Probability; Public Parameter
GND Keyword:Kryptologie; Kongress; Santa Barbara; Online-Publikation
Page Number:19
Erschienen in: Mihir Bellare (Hrsg.): Advances in cryptology : proceedings, Berlin ; Heidelberg ; New York ; Barcelona ; Hong Kong ; London ; Milan ; Paris ; Singapore ; Tokyo : Springer, 2000, Lecture notes in computer science ; Vol. 1880, S. 413-431, ISBN: 978-3-540-67907-3, ISBN: 3-540-67907-3, ISBN: 978-3-540-44598-2, doi:10.1007/3-540-44598-6_26
Source:Advances in Cryptology - Crypto 2000 , Lecture Notes in Computer Science, Vol.1880, pp.414-432, Springer-Verlag, 2000 , http://link.springer.de/link/service/series/0558/tocs/t1880.htm , http://www.mi.informatik.uni-frankfurt.de/research/papers.html
Institutes:Informatik und Mathematik / Mathematik
Informatik und Mathematik / Informatik
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):License LogoDeutsches Urheberrecht