Impossibility results for lattice-based functional encryption schemes
From MaRDI portal
Publication:2055607
DOI10.1007/978-3-030-45721-1_7zbMath1479.94261OpenAlexW3013056757MaRDI QIDQ2055607
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_7
Related Items (2)
Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ Impossibility results for lattice-based functional encryption schemes
Cites Work
- Unnamed Item
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Functional encryption for bounded collusions, revisited
- Decentralized multi-client functional encryption for inner product
- Impossibility results for lattice-based functional encryption schemes
- On perfect correctness in (lockable) obfuscation
- Optimal bounded-collusion secure functional encryption
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Decentralizing inner-product functional encryption
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Functional Encryption for Inner Product with Full Function Privacy
- Function-Hiding Inner Product Encryption
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
- Simple Functional Encryption Schemes for Inner Products
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Indistinguishability Obfuscation from Compact Functional Encryption
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Online/Offline Attribute-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Attribute-based encryption for circuits
- Ad Hoc Multi-Input Functional Encryption.
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Impossibility results for lattice-based functional encryption schemes
