A framework and compact constructions for non-monotonic attribute-based encryption
From MaRDI portal
Publication:5402976
DOI10.1007/978-3-642-54631-0_16zbMATH Open1335.94084OpenAlexW2235014515MaRDI QIDQ5402976FDOQ5402976
Authors: Shota Yamada, Nuttapong Attrapadung, Goichiro Hanaoka, Noboru Kunihiro
Publication date: 25 March 2014
Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_16
Recommendations
- Computationally efficient expressive key-policy attribute based encryption schemes with constant-size ciphertext
- Attribute-based encryption schemes with constant-size ciphertexts
- Constant decryption-cost non-monotonic ciphertext policy attribute-based encryption with reduced secret key size (and dynamic attributes)
- Expressive key-policy attribute-based encryption with constant-size ciphertexts
- Computational friendly attribute-based encryptions with short ciphertext
Cited In (25)
- Non-zero inner product encryption with short ciphertexts and private keys
- A compact construction for non-monotonic online/offline CP-ABE
- Simplifying design and analysis of complex predicate encryption schemes
- GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs
- Fast, compact, and expressive attribute-based encryption
- Fast, compact, and expressive attribute-based encryption
- ABE for circuits with constant-size secret keys and adaptive security
- Public-key puncturable encryption: modular and compact constructions
- Complementary set encryption for privacy-preserving data consolidation
- Hierarchical and non-monotonic key-policy attribute-based encryption and its application
- Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts
- Compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Unbounded non-zero inner product encryption
- Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper)
- Attribute-based encryption for range attributes
- Constant decryption-cost non-monotonic ciphertext policy attribute-based encryption with reduced secret key size (and dynamic attributes)
- A new technique for compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption
- Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
- A study of pair encodings: predicate encryption in prime order groups
- Conversions among several classes of predicate encryption and applications to ABE with various compactness tradeoffs
This page was built for publication: A framework and compact constructions for non-monotonic attribute-based encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402976)