Attribute-based encryption using sum-product decomposition of Boolean functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 7829260 (Why is no real title available?)
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Attribute based encryption for Turing machines from lattices
- Attribute-based encryption for circuits from multilinear maps
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Fast, compact, and expressive attribute-based encryption
- Fully secure attribute-based encryption for t-CNF from LWE
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure unbounded inner-product and attribute-based encryption
- Functional encryption for regular languages
- Functional signatures and pseudorandom functions
- Fuzzy Identity-Based Encryption
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Optimal broadcast encryption from pairings and LWE
- Pseudorandom functions: three decades later
- Unbounded dynamic predicate compositions in ABE from standard assumptions
This page was built for publication: Attribute-based encryption using sum-product decomposition of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877574)
