Indistinguishability Obfuscation for Turing Machines with Unbounded Memory

DOI10.1145/2746539.2746614zbMath1321.94069OpenAlexW2039677636MaRDI QIDQ2941534

Allison Bishop Lewko, Venkata Koppula, Brent Waters

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2746539.2746614

zbMATH Keywords

Turing machinesobfuscation

Mathematics Subject Classification ID

Related Items (40)

A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Laconic function evaluation for Turing machines ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Collusion-resistant functional encryption for RAMs ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ No-signaling linear PCPs ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Functional Encryption for Turing Machines ⋮ Perfect Structure on the Edge of Chaos ⋮ No-signaling linear PCPs ⋮ Obfustopia built on secret-key functional encryption ⋮ Oblivious Parallel RAM and Applications ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Obfuscation Combiners ⋮ On the Existence of Extractable One-Way Functions ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Fully deniable interactive encryption ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Indistinguishability Obfuscation for Turing Machines with Unbounded Memory