TY - CHAP T1 - Efficient and Non-interactive Non-malleable Commitment T2 - Advances in Cryptology — EUROCRYPT 2001Advances in Cryptology — EUROCRYPT 2001 Y1 - 2001 A1 - Di Crescenzo,Giovanni A1 - Katz, Jonathan A1 - Ostrovsky,Rafail A1 - Smith,Adam ED - Pfitzmann,Birgit KW - Computer science AB - We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are non-interactive . Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding. JA - Advances in Cryptology — EUROCRYPT 2001Advances in Cryptology — EUROCRYPT 2001 T3 - Lecture Notes in Computer Science PB - Springer Berlin / Heidelberg VL - 2045 SN - 978-3-540-42070-5 UR - http://www.springerlink.com/content/nhbj60a9da101w0r/abstract/ ER -