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. © 2010 Springer.
Cite
CITATION STYLE
Canetti, R., Rothblum, G. N., & Varia, M. (2010). Obfuscation of hyperplane membership. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5978 LNCS, pp. 72–89). Springer Verlag. https://doi.org/10.1007/978-3-642-11799-2_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
