A simple construction of iO for Turing machines
From MaRDI portal
Publication:1631340
DOI10.1007/978-3-030-03810-6_16zbMath1430.94069OpenAlexW2894216532MaRDI QIDQ1631340
Akshayaram Srinivasan, Sanjam Garg
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_16
Related Items
A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Laconic function evaluation for Turing machines ⋮ 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 ⋮ Non-interactive universal arguments ⋮ Universal ring signatures in the standard model ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
Cites Work
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Adaptively secure garbling with near optimal online complexity
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- New constructions of identity-based and key-dependent message secure encryption schemes
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Adaptively Secure Garbled Circuits from One-Way Functions
- Constrained Pseudorandom Functions and Their Applications
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Indistinguishability Obfuscation from Compact Functional Encryption
- Relations Among Complexity Measures
- Indistinguishability Obfuscation from Functional Encryption
- Garbled Circuits as Randomized Encodings of Functions: a Primer
- How to use indistinguishability obfuscation
- Breaking the Sub-Exponential Barrier in Obfustopia
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Witness encryption and its applications
- Two-Round Secure MPC from Indistinguishability Obfuscation
