Functional Encryption for Turing Machines
From MaRDI portal
Recommendations
- Functional encryption
- Functional encryption for randomized functionalities
- Functional encryption for cascade automata
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Functional encryption for regular languages
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Foundations of functional encryption
- Verifiable functional encryption
- Functional encryption for cascade automata (extended abstract)
- Functional encryption: deterministic to randomized functions from simple assumptions
Cites work
- A punctured programming approach to adaptively secure functional encryption
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part II
- Anonymous traitor tracing: how to embed arbitrary information in a key
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Computationally private randomizing polynomials and their applications
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- From selective to adaptive security in functional encryption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Function-private functional encryption in the private-key setting
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation: from approximate to exact
- Multi-input functional encryption
- On extractability obfuscation
- On the (im)possibility of obfuscating programs
- On the achievability of simulation-based security for functional encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Protecting obfuscation against algebraic attacks
- Public-coin differing-inputs obfuscation and its applications
- Reusable garbled circuits and succinct functional encryption
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct randomized encodings and their applications
Cited in
(51)- Adaptive security of practical garbling schemes
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Multi-client attribute-based unbounded inner product functional encryption, and more
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Registered FE beyond predicates: (attribute-based) linear functions and more
- How to run Turing machines on encrypted data
- The pseudorandom oracle model and ideal obfuscation
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- FE and iO for Turing machines from minimal assumptions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Bounded Collusion ABE for TMs from IBE
- Delegating RAM computations with adaptive soundness and privacy
- Single-key to multi-key functional encryption with polynomial loss
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Breaking the sub-exponential barrier in obfustopia
- Reusable garbled deterministic finite automata from learning with errors
- Selected Areas in Cryptography
- From cryptomania to obfustopia through secret-key functional encryption
- Homomorphic encryption for finite automata
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- Attribute-based access control for inner product functional encryption from LWE
- CRYPTAUTOMATA WITH FUNCTIONAL KEYS
- Unbounded quadratic functional encryption and more from pairings
- Pseudorandom FE, iO and applications
- Adaptively secure streaming functional encryption
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Simpler constructions of asymmetric primitives from obfuscation
- Semi-adaptive security and bundling functionalities made generic and easy
- Collusion-resistant functional encryption for RAMs
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Streaming functional encryption
- Tracing quantum state distinguishers via backtracking
- Attribute based encryption for deterministic finite automata from DLIN
- Limits on the adaptive security of Yao's garbling
- Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- Certified everlasting secure collusion-resistant functional encryption, and more
- From cryptomania to obfustopia through secret-key functional encryption
- A punctured programming approach to adaptively secure functional encryption
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
- Strongly full-hiding inner product encryption
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Reusable garbled circuits and succinct functional encryption
This page was built for publication: Functional Encryption for Turing Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796122)
