TCC 2009: Theory of Cryptography pp 73-90

Non-malleable Obfuscation

  • Ran Canetti
  • Mayank Varia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5444)

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ran Canetti
    • 1
  • Mayank Varia
    • 2
  1. 1.School of Computer ScienceTel Aviv University 
  2. 2.Massachusetts Institute of Technology 

Personalised recommendations