@inbook {15072,
	title = {Efficient and Non-interactive Non-malleable Commitment},
	booktitle = {Advances in Cryptology {\textemdash} EUROCRYPT 2001Advances in Cryptology {\textemdash} EUROCRYPT 2001},
	series = {Lecture Notes in Computer Science},
	volume = {2045},
	year = {2001},
	month = {2001///},
	pages = {40 - 59},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	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.},
	keywords = {Computer science},
	isbn = {978-3-540-42070-5},
	url = {http://www.springerlink.com/content/nhbj60a9da101w0r/abstract/},
	author = {Di Crescenzo,Giovanni and Katz, Jonathan and Ostrovsky,Rafail and Smith,Adam},
	editor = {Pfitzmann,Birgit}
}
