Refine
Document Type
- Preprint (8)
- Article (1)
- diplomthesis (1)
- Doctoral Thesis (1)
Has Fulltext
- yes (11)
Is part of the Bibliography
- no (11)
Keywords
- Kongress (5)
- Kryptologie (5)
- Online-Publikation (4)
- Commitment Scheme (2)
- Oblivious Transfer (2)
- San Jose (2)
- Blind Signature (1)
- Chinese Remainder Theorem (1)
- Commitment (1)
- Commitment schemes (1)
Institute
- Mathematik (11) (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].