Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
From MaRDI portal
Cites work
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- A practical compiler for attribute-based encryption: new decentralized constructions and more
- ABE for circuits with \(\mathsf{poly}( \lambda )\)-sized keys from LWE
- ABE for circuits with constant-size secret keys and adaptive security
- ABE for DFA from k-lin
- ABE for DFA from LWE against bounded collusions, revisited
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Adaptively secure attribute-based encryption from witness encryption
- Advances in Cryptology – CRYPTO 2004
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Attribute based encryption for Turing machines from lattices
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Attribute-based encryption for circuits
- Attribute-based encryption for circuits from multilinear maps
- Attribute-based encryption for circuits of unbounded depth from lattices
- Attribute-based functional encryption on lattices
- Be adaptive, avoid overcommitting
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin
- 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
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Decentralizing attribute-based encryption
- Dual system encryption framework in prime-order groups via computational pair encodings
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption via Predicate Encodings
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Efficient attribute-based signatures for unbounded arithmetic branching programs
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Efficient selective identity-based encryption without random oracles
- Efficient statically-secure large-universe multi-authority attribute-based encryption
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Faster ABE for Turing machines from circular evasive LWE
- Faster integer multiplication
- Fully adaptive decentralized multi-authority \textsf{ABE}
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- 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 inner product predicates from learning with errors
- Functional encryption for regular languages
- Fuzzy Identity-Based Encryption
- How to Garble Arithmetic Circuits
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Improved dual system ABE in prime-order groups via predicate encodings
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- Information security and cryptology -- ICISC 2008. 11th international conference, Seoul, Korea, December 3--5, 2008. Revised selected papers
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Lattice-based post-quantum iO from circular security with random opening assumption
- Lockable obfuscation
- Multi-authority ABE from lattices without random oracles
- Multi-authority Attribute Based Encryption
- Multi-input attribute based encryption and predicate encryption
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- ON MULTI-AUTHORITY CIPHERTEXT-POLICY ATTRIBUTE-BASED ENCRYPTION
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Optimal broadcast encryption from pairings and LWE
- Partial garbling schemes and their applications
- Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Unbounded ABE for circuits from LWE, revisited
- Unbounded ABE via bilinear entropy expansion, revisited
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Unbounded dynamic predicate compositions in attribute-based encryption
- Unbounded HIBE and Attribute-Based Encryption
This page was built for publication: Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232684)
