A general framework for lattice-based ABE using evasive inner-product functional encryption
From MaRDI portal
Publication:6636517
DOI10.1007/978-3-031-58723-8_15MaRDI QIDQ6636517
Ji Luo, Huijia Lin, Yao-Ching Hsieh
Publication date: 12 November 2024
Cites Work
- On computing the determinant in small parallel time using a small number of processors
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Stronger security for reusable garbled circuits, general definitions and attacks
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Optimal broadcast encryption from pairings and LWE
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Optimal broadcast encryption from LWE and pairings in the standard model
- Counterexamples to new circular security assumptions underlying iO
- Targeted lossy functions and applications
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- ABE for DFA from LWE against bounded collusions, revisited
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- How to Run Turing Machines on Encrypted Data
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Functional Encryption for Regular Languages
- Simple Functional Encryption Schemes for Inner Products
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption
- Cryptanalysis of the Multilinear Map over the Integers
- Structure and importance of logspace-MOD class
- Reusable Garbled Deterministic Finite Automata from Learning With Errors
- Fuzzy Identity-Based Encryption
- Deterministic methods to find primes
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- How to Garble Arithmetic Circuits
- Attribute-based encryption for circuits
- On lattices, learning with errors, random linear codes, and cryptography
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Multi-authority ABE from lattices without random oracles
- ABE for circuits with constant-size secret keys and adaptive security
- Witness encryption and null-iO from evasive LWE
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Candidate witness encryption from lattice techniques
This page was built for publication: A general framework for lattice-based ABE using evasive inner-product functional encryption
