Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
summary
Proposes a unifying framework where primitives are schemas of interactive program “agents,” security is indistinguishability-preserving security (tests that are hiding in the ideal world remain hiding after objectification), and real/ideal separation uses an objectifying algorithm O and evaluator E. Shows full obfuscation is impossible for all polynomial tests but becomes plausible under a restricted delta test family; proves a composition theorem for reductions and gives simple constructions—e.g., public-key functional encryption from a delta-style obfuscator plus signatures—that meet the framework’s security conditions.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 0:27New Primitives
- 2:02Definitions
- 3:38Do we need a framework
- 5:36Our framework
- 8:20Definition
- 14:22Security
- 18:37Obfuscation
- 20:37Test families
related talks
48mTales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy
01h 15mThe Journey Towards Program Obfuscation
01h 12mApplications of Obfuscation I
38mRecent Advances on Foundations of Program Obfuscation
46mObfuscation of Unitary Quantum Programs
57mThe Cryptographic Lens: Visions of our Past and Future
01h 04mHow to Encrypt a Functionality
10mCryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation