We formulate two natural flavors of non-malleability requirements for program obfuscation, and show that they are incomparable in general. We also construct non-malleable obfuscators of both flavors for some program families of interest. Some of our constructions are in the Random Oracle model, whereas another one is in the common reference string model. We also define the notion of verifiable obfuscation which is of independent interest.
Category / Keywords: foundations / obfuscation, non-malleability Date: received 25 Nov 2008 Contact author: varia at csail mit edu Available format(s): PDF | BibTeX Citation Version: 20081202:015226 (All versions of this report) Short URL: ia.cr/2008/495 Discussion forum: Show discussion | Start new discussion