Obfuscation of Hyperplane Membership

Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (point functions). In this work, we construct an obfuscator for a more complex algebraic functionality: testing for membership in a hyperplane (of constant dimension). We prove the security of the obfuscator under a new strong variant of the Decisional Die-Hellman assumption. Finally, we show a cryptographic application of the new obfuscator to digital signatures.

• Type: Journal
• Year: 2010
• Where: TCC
• Authors: Ran Canetti, Guy N. Rothblum, Mayank Varia
• Keywords: Complex Algebraic Functionality, Cryptology, Decisional Die-Hellman Assumption, Obfuscator, TCC 2010