[Goy11] Constant round non-malleable protocols using one way functions

Authors: Vipul Goyal | Venue: STOC 2011 | Source

Abstract

We provide the first constant round constructions of non-malleable commitment and zero-knowledge protocols based only on one-way functions. This improves upon several previous (incomparable) works which required either: (a) super-constant number of rounds, or, (b) non-standard or sub-exponential hardness assumptions, or, (c) non-black-box simulation and collision resistant hash functions. These constructions also allow us to obtain the first constant round multi-party computation protocol relying only on the existence of constant round oblivious transfer protocols. Our primary technique can be seen as a means of implementing the previous “two-slot simulation” idea in the area of non-malleability with only black-box simulation.

A simple modification of our commitment scheme gives a construction which makes use of the underlying one-way function in a black-box way. The modified construction satisfies the notion of what we call non-malleability w.r.t. replacement. Non-malleability w.r.t. replacement is a slightly weaker yet natural notion of non-malleability which we believe suffices for many application of non-malleable commitments. We show that a commitment scheme which is non-malleable only w.r.t. replacement is sufficient to obtain a (fully) black-box multi-party computation protocol. This allows us to obtain a constant round multi-party computation protocol making only a black-box use of the standard cryptographic primitives with polynomial-time hardness thus directly improving upon the recent work of Wee (FOCS’10).

BibTeX

@Inproceedings{STOC:Goyal11,
  author = {Vipul Goyal},
  title = {Constant round non-malleable protocols using one way functions},
  pages = {695--704},
  editor = {Lance Fortnow and Salil P. Vadhan},
  booktitle = {43rd Annual {ACM} Symposium on Theory of Computing},
  address = {San Jose, CA, USA},
  month = {jun~6--8},
  publisher = {{ACM} Press},
  year = {2011},
  doi = {10.1145/1993636.1993729},
}