Speaker: Mayank Varia , Math, MIT
Date: May 16 2008
Time: 10:30AM to 12:00PM
Location: G449, Patil/Kiva
Contact: Be Blackburn, 3-6098, email@example.com
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 quite different flavors of non-malleability
requirements for program obfuscation, and 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.
This is joint work with Ran Canetti.
See other events that are part of Cryptography and Information Security Seminars 2007/2008
See other events happening in May 2008