Refine
Year of publication
- 2000 (1) (remove)
Document Type
- Preprint (1) (remove)
Language
- English (1)
Has Fulltext
- yes (1)
Is part of the Bibliography
- no (1)
Keywords
- Chinese Remainder Theorem (1)
- Commitment Scheme (1)
- Discrete Logarithm (1)
- Kongress (1)
- Kryptologie (1)
- Noticeable Probability (1)
- Online-Publikation (1)
- Public Parameter (1)
- Santa Barbara (1)
Institute
- Informatik (1) (remove)
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].