Attribute-based access control for inner product functional encryption from LWE
From MaRDI portal
Publication:2146083
DOI10.1007/978-3-030-88238-9_7zbMath1491.94062OpenAlexW3211122492MaRDI QIDQ2146083
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88238-9_7
Related Items (4)
Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Multi-client functional encryption with fine-grained access control ⋮ (Inner-product) functional encryption with updatable ciphertexts
Cites Work
- Unnamed Item
- Unnamed Item
- Traceable inner product functional encryption
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- FE for inner products and its application to decentralized ABE
- Unbounded inner-product functional encryption with succinct keys
- Sum-of-squares meets program obfuscation, revisited
- 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
- Functional Encryption for Turing Machines
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Simple Functional Encryption Schemes for Inner Products
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Functional Encryption: Definitions and Challenges
- Secure Obfuscation in a Weak Multilinear Map Model
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Fuzzy Identity-Based Encryption
- Generating Shorter Bases for Hard Random Lattices
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Attribute-based access control for inner product functional encryption from LWE
