[Resource Topic] 2001/032: Efficient and Non-Interactive Non-Malleable Commitment

Welcome to the resource topic for 2001/032

Efficient and Non-Interactive Non-Malleable Commitment

Authors: Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith


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.

ePrint: https://eprint.iacr.org/2001/032

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .