Circuit ABE with poly(depth, )-sized ciphertexts and keys from lattices
From MaRDI portal
Publication:6652896
Recommendations
Cites work
- ABE for circuits with constant-size secret keys and adaptive security
- Attribute-based encryption for circuits
- Bonsai trees, or how to delegate a lattice basis
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Candidate witness encryption from lattice techniques
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- CP-ABE for circuits (and More) in the symmetric key setting
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient lattice (H)IBE in the standard model
- Expressive key-policy attribute-based encryption with constant-size ciphertexts
- Fiat-Shamir: from practice to theory
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fuzzy Identity-Based Encryption
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 7829260 (Why is no real title available?)
- Key homomorphic PRFs and their applications
- Laconic function evaluation for Turing machines
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Laconic oblivious transfer and its applications
- Lattice-based FHE as secure as PKE
- Leveled fully homomorphic signatures from standard lattices
- Multi-authority ABE from lattices without random oracles
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Optimal broadcast encryption from LWE and pairings in the standard model
- Optimal broadcast encryption from pairings and LWE
- Predicate encryption for circuits from LWE
- Pseudorandom functions and lattices
- Reusable garbled circuits and succinct functional encryption
- Riding on asymmetry: efficient ABE for branching programs
- Security Analysis of the Strong Diffie-Hellman Problem
- Succinct vector, polynomial, and functional commitments from lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Witness encryption and null-iO from evasive LWE
Cited in
(15)- A general framework for lattice-based ABE using evasive inner-product functional encryption
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Unbounded distributed broadcast encryption and registered ABE from succinct LWE
- Attribute-based encryption using sum-product decomposition of Boolean functions
- Faster ABE for Turing machines from circular evasive LWE
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Distributed broadcast encryption from lattices
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Pseudorandom FE, iO and applications
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more
- Succinct garbled circuits with low-depth garbling algorithms
- Distributed monotone-policy encryption for DNFs from lattices
This page was built for publication: Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652896)
