Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
Name
15m1050963.pdf
Description
Published version
Size
948.81 KB
Format
Adobe PDF
Checksum (MD5)
41986a5f21c2ee928d708f059979b761
Author(s)
Bitansky, Nir
Canetti, Ran
Garg, Sanjam
Holmgren, Justin
Jain, Abhishek
Lin, Huijia
Pass, Rafael
Telang, Sidharth
Vaikuntanathan, Vinod
Date Issued
January 2018
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Citation
Bitansky, Nir, Canetti, Ran, Garg, Sanjam, Holmgren, Justin, Jain, Abhishek et al. 2018. "Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings." 47 (3).
Version
Final published version
Abstract
© 2018 Society for Industrial and Applied Mathematics. We show how to construct indistinguishability obfuscation (\bfi/bfO) for RAM programs with bounded space, assuming/bfi/bfO for circuits and one-way functions, both with subexponential security. That is, given a RAM program whose computation requires space s(n) in the worst case for inputs of length at most n, we generate an obfuscated RAM program that, for inputs of size at most n, runs in roughly the same time as the original program, using space roughly s(n). The obfuscation process is quasi-linear in the description length of the input program and s(n). At the heart of our construction are succinct randomized encodings for RAM programs. We present two very different constructions of such encodings, each with its own unique properties. Beyond their use as a tool in obfuscation for RAM programs, we show that succinct randomized encodings are interesting objects in their own right. We demonstrate the power of succinct randomized encodings in applications such as publicly verifiable delegation, functional encryption for RAMs, and key-dependent security amplification.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/15m1050963
