TY  - INPR
A1  - Fischlin, Marc
A1  - Fischlin, Roger
A2  - Bellare, Mihir
T1  - Efficient non-malleable commitment schemes
N2  - 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].
KW  - Kryptologie
KW  - Kongress
KW  - Santa Barbara
KW  - Online-Publikation
KW  - Discrete Logarithm
KW  - Commitment Scheme
KW  - Chinese Remainder Theorem
KW  - Public Parameter
KW  - Noticeable Probability
Y1  - 2000
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4225
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12631
SN  - 978-3-540-67907-3
SN  - 3-540-67907-3
SN  - 978-3-540-44598-2
N1  - 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
ER  -