Functional Encryption for Turing Machines
From MaRDI portal
Publication:2796122
DOI10.1007/978-3-662-49096-9_6zbMath1388.94031OpenAlexW2294870584MaRDI QIDQ2796122
Amit Sahai, Prabhanjan V. Ananth
Publication date: 23 March 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_6
Related Items (32)
Limits on the adaptive security of Yao's garbling ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Adaptive security of practical garbling schemes ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Bounded Collusion ABE for TMs from IBE ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Collusion-resistant functional encryption for RAMs ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Streaming functional encryption ⋮ Tracing quantum state distinguishers via backtracking ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Strongly full-hiding inner product encryption ⋮ Fully secure functional encryption with a large class of relations from the decisional linear assumption ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ Breaking the Sub-Exponential Barrier in Obfustopia
Cites Work
- Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part II
- Computationally private randomizing polynomials and their applications
- Indistinguishability Obfuscation: From Approximate to Exact
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
- Functional Encryption: Definitions and Challenges
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Function-Private Functional Encryption in the Private-Key Setting
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- Fuzzy Identity-Based Encryption
- On the (im)possibility of obfuscating programs
- Protecting Obfuscation against Algebraic Attacks
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Multi-input Functional Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
- On Extractability Obfuscation
This page was built for publication: Functional Encryption for Turing Machines
