Obfuscating straight line arithmetic programs
Srivatsan Narayanan, Ananth Raghunathan, Ramarathnam Venkatesan · 2009
Program Obfuscation that renders any given program essentially equivalent to a black box, while desirable, is impossible [4] in the general polynomial time adversary models. It is natural to search for positive results under restricted programs (e.g., point functions [20, 2] POBDDs [10], cryptographic primitives [17, 12, 13]. Here we study straight line arithmetic programs.