Efficient and Non-interactive Non-malleable Commitment
Title | Efficient and Non-interactive Non-malleable Commitment |
Publication Type | Book Chapters |
Year of Publication | 2001 |
Authors | Di Crescenzo G, Katz J, Ostrovsky R, Smith A |
Editor | Pfitzmann B |
Book Title | Advances in Cryptology — EUROCRYPT 2001Advances in Cryptology — EUROCRYPT 2001 |
Series Title | Lecture Notes in Computer Science |
Volume | 2045 |
Pagination | 40 - 59 |
Publisher | Springer Berlin / Heidelberg |
ISBN Number | 978-3-540-42070-5 |
Keywords | Computer science |
Abstract | 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. |
URL | http://www.springerlink.com/content/nhbj60a9da101w0r/abstract/ |