Succinct garbling and indistinguishability obfuscation for RAM programs

Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show how to construct succinct Indistinguishability Obfuscation (IO) schemes for RAM programs. That is, given a RAM program whose computation requires space S and time T, we generate a RAM program with size and space requirements of Õ (S) and runtime Õ(T). The construction uses non-succinct IO (i.e., IO for circuits) and injective one way functions, both with sub-exponential security. A main component in our scheme is a succinct garbling scheme for RAM programs. Our garbling scheme has the same size, space and runtime parameters as above, and requires only polynomial security of the underlying primitives. This scheme has other qualitatively new applications such as publicly verifiable succinct non-interactive delegation of computation and succinct functional encryption.

Original languageEnglish
Title of host publicationSTOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing
PublisherAssociation for Computing Machinery
Pages429-437
Number of pages9
ISBN (Electronic)9781450335362
DOIs
StatePublished - 14 Jun 2015
Event47th Annual ACM Symposium on Theory of Computing, STOC 2015 - Portland, United States
Duration: 14 Jun 201517 Jun 2015

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
Volume14-17-June-2015
ISSN (Print)0737-8017

Conference

Conference47th Annual ACM Symposium on Theory of Computing, STOC 2015
Country/TerritoryUnited States
CityPortland
Period14/06/1517/06/15

Fingerprint

Dive into the research topics of 'Succinct garbling and indistinguishability obfuscation for RAM programs'. Together they form a unique fingerprint.

Cite this