CryptoDB
Efficient and Non-Interactive Non-Malleable Commitment
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2001-11444, title={Efficient and Non-Interactive Non-Malleable Commitment}, booktitle={IACR Eprint archive}, keywords={foundations / non-malleable, malleability, commitment}, url={http://eprint.iacr.org/2001/032}, note={Eurocrypt 2001 jkatz@cs.columbia.edu 11438 received 23 Apr 2001, last revised 26 Apr 2001}, author={Giovanni Di Crescenzo and Jonathan Katz and Rafail Ostrovsky and Adam Smith}, year=2001 }