International Association for Cryptologic Research
Using recently developed techniques for program obfuscation, the authors show several constructions of non-interactive cryptosystems in the Random-Access Machine (RAM) model of computation that are asymptotically more efficient than what would be obtained using generic RAM-to-circuit compilation. In particular, let T denote the running time and n the memory size of a RAM program. They show that using differing-inputs obfuscation, functional encryption for arbitrary RAM programs can be achieved with evaluation time O (T + n). Additionally, they provide a number of RAM-model constructions assuming the stronger notion of Virtual Black-Box (VBB) obfuscation.