Fast, compact, and expressive attribute-based encryption
From MaRDI portal
Recommendations
- Fast, compact, and expressive attribute-based encryption
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Expressive key-policy attribute-based encryption with constant-size ciphertexts
- Attribute-based encryption schemes with constant-size ciphertexts
- Attribute-based encryption with fast decryption
Cites work
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- A framework and compact constructions for non-monotonic attribute-based encryption
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Be adaptive, avoid overcommitting
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Decentralizing attribute-based encryption
- Dual System Encryption via Predicate Encodings
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Expressive key-policy attribute-based encryption with constant-size ciphertexts
- Extended tower number field sieve: a new complexity for the medium prime case
- 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
- Fuzzy Identity-Based Encryption
- Identity-Based Encryption from the Weil Pairing
- Improved dual system ABE in prime-order groups via predicate encodings
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Secure integration of asymmetric and symmetric encryption schemes
- Simplifying design and analysis of complex predicate encryption schemes
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The random oracle methodology, revisited.
- Topics in Cryptology – CT-RSA 2005
- Unbounded ABE via bilinear entropy expansion, revisited
- Unbounded dynamic predicate compositions in attribute-based encryption
Cited in
(33)- New proof methods for attribute-based encryption: achieving full security through selective techniques
- Security-level switchable attribute-based encryption under the strictly weaker assumption family
- A practical compiler for attribute-based encryption: new decentralized constructions and more
- Key-policy ABE with switchable attributes
- Homomorphic-policy attribute-based key encapsulation mechanisms
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
- Efficient attribute-based encryption with blackbox traceability
- Mitigating the one-use restriction in attribute-based encryption
- Adaptable key-policy attribute-based encryption with time interval
- Attribute-based encryption with fast decryption
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Key-policy attribute-based encryption scheme for general circuits
- GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs
- Fast, compact, and expressive attribute-based encryption
- New proof techniques for DLIN-based adaptively secure attribute-based encryption
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Improvement of attribute-based encryption using Blakley secret sharing
- Attribute Based Encryption with Direct Efficiency Tradeoff
- Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Unbounded dynamic predicate compositions in attribute-based encryption
- A survey of lattice based expressive attribute based encryption
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Reducing the CRS size in registered ABE systems
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- Attribute-based encryption for range attributes
- Practical large universe attribute-set based encryption in the standard model
- Covercrypt: an efficient early-abort KEM for hidden access policies with traceability from the DDH and LWE
- Dually computable cryptographic accumulators and their application to attribute based encryption
This page was built for publication: Fast, compact, and expressive attribute-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041150)
