Paper 2001/032

Efficient and Non-Interactive Non-Malleable Commitment

Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, and Adam Smith

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.

Note: Revised to indicate that this is an extended version of what will appear at Eurocrypt 2001.

Metadata
Available format(s)
PDF PS
Category
Foundations
Publication info
Published elsewhere. Eurocrypt 2001
Keywords
non-malleablemalleabilitycommitment
Contact author(s)
jkatz @ cs columbia edu
History
2001-04-27: received
Short URL
https://ia.cr/2001/032
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2001/032,
      author = {Giovanni Di Crescenzo and Jonathan Katz and Rafail Ostrovsky and Adam Smith},
      title = {Efficient and Non-Interactive Non-Malleable Commitment},
      howpublished = {Cryptology ePrint Archive, Paper 2001/032},
      year = {2001},
      note = {\url{https://eprint.iacr.org/2001/032}},
      url = {https://eprint.iacr.org/2001/032}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.