On Low End Obfuscation and Learning

Gal Yehuda (Technion)
Lower Bounds, Learning, and Average-Case Complexity

Abstract
Most recent works on cryptographic obfuscation focus on the high-end regime of obfuscating general circuits while guaranteeing computational indistinguishability between functionally equivalent circuits. Motivated by the goals of simplicity and efficiency, we initiate a systematic study of ``low-end'' obfuscation, focusing on simpler representation models and information-theoretic notions of security.