Obfuscation of Hyperplane Membership

  • Ran Canetti
  • Guy N. Rothblum
  • Mayank Varia
Conference paper

DOI: 10.1007/978-3-642-11799-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5978)
Cite this paper as:
Canetti R., Rothblum G.N., Varia M. (2010) Obfuscation of Hyperplane Membership. In: Micciancio D. (eds) Theory of Cryptography. TCC 2010. Lecture Notes in Computer Science, vol 5978. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Ran Canetti
    • 1
  • Guy N. Rothblum
    • 2
  • Mayank Varia
    • 3
  1. 1.School of Computer ScienceTel Aviv UniversityIsrael
  2. 2.Princeton UniversityUSA
  3. 3.Massachusetts Institute of TechnologyUSA

Personalised recommendations