Paper Info
Title
A Simple Construction Of Io For Turing Machines
Abstract
We give a simple construction of indistinguishability obfuscation for Turing machines where the time to obfuscate grows only with the description size of the machine and otherwise, independent of the running time and the space used. While this result is already known [Koppula, Lewko, and Waters, STOC 2015] from iO for circuits and injective pseudorandom generators, our construction and its analysis are conceptually much simpler. In particular, the main technical component in the proof of our construction is a simple combinatorial pebbling argument [Garg and Srinivasan, EUROCRYPT 2018]. Our construction makes use of indistinguishability obfuscation for circuits and somewhere statistically binding hash functions.
Year
DOI
Venue
2018
10.1007/978-3-030-03810-6_16
THEORY OF CRYPTOGRAPHY, TCC 2018, PT II
DocType
Volume
ISSN
Conference
11240
0302-9743
Citations 
PageRank 
References 
2
0.35
20
Authors
2
Name
Order
Citations
PageRank
Sanjam Garg1171069.92
Akshayaram Srinivasan211112.08