### Non-Malleable Obfuscation

Ran Canetti and Mayank Varia

##### Abstract

Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way. 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.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
obfuscationnon-malleability
Contact author(s)
varia @ csail mit edu
History
Short URL
https://ia.cr/2008/495

CC BY

BibTeX

@misc{cryptoeprint:2008/495,
author = {Ran Canetti and Mayank Varia},
title = {Non-Malleable Obfuscation},
howpublished = {Cryptology ePrint Archive, Paper 2008/495},
year = {2008},
note = {\url{https://eprint.iacr.org/2008/495}},
url = {https://eprint.iacr.org/2008/495}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.