Obfuscation of hyperplane membership

  • Authors:
  • Ran Canetti;Guy N. Rothblum;Mayank Varia

  • Affiliations:
  • School of Computer Science, Tel Aviv University;Princeton University;Massachusetts Institute of Technology

  • Venue:
  • TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

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 Diffie-Hellman assumption. Finally, we show a cryptographic application of the new obfuscator to digital signatures.