Functional encryption for Turing machines with dynamic bounded collusion from LWE
From MaRDI portal
Publication:2139636
DOI10.1007/978-3-030-84259-8_9zbMath1489.94083OpenAlexW3183438388MaRDI QIDQ2139636
Shweta Agrawal, Monosij Maitra, Narasimha Sai Vempati, Shota Yamada
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_9
Related Items (7)
Dynamic collusion bounded functional encryption from identity-based encryption ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Pattern matching in encrypted stream from inner product encryption ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Functional encryption with secure key leasing ⋮ Multi-client functional encryption with fine-grained access control ⋮ Hardness of (M)LWE with semi-uniform seeds
Cites Work
- Unnamed Item
- FE and iO for Turing machines from minimal assumptions
- Stronger security for reusable garbled circuits, general definitions and attacks
- Identity-based encryption from the Diffie-Hellman assumption
- Functional encryption for bounded collusions, revisited
- Key dependent message security and receiver selective opening security for identity-based encryption
- 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
- Optimal bounded-collusion secure functional encryption
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Functional Encryption for Turing Machines
- Functional Encryption: New Perspectives and Lower Bounds
- How to Run Turing Machines on Encrypted Data
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Functional Encryption: Definitions and Challenges
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Reusable Garbled Deterministic Finite Automata from Learning With Errors
- Fuzzy Identity-Based Encryption
- Reusable garbled circuits and succinct functional encryption
This page was built for publication: Functional encryption for Turing machines with dynamic bounded collusion from LWE
