Expressive key-policy attribute-based encryption with constant-size ciphertexts
From MaRDI portal
(Redirected from Publication:3084342)
Recommendations
- Attribute-based encryption schemes with constant-size ciphertexts
- Computationally efficient expressive key-policy attribute based encryption schemes with constant-size ciphertext
- Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption
- Computational friendly attribute-based encryptions with short ciphertext
- Efficient ciphertext policy attribute-based encryption with constant-size ciphertext and constant computation-cost
Cited in
(72)- Constant decryption-cost non-monotonic ciphertext policy attribute-based encryption with reduced secret key size (and dynamic attributes)
- Compact NIZKs from standard assumptions on bilinear maps
- Fully secure ABE with outsourced decryption against chosen ciphertext attack
- Efficient fully CCA-secure predicate encryptions from pair encodings
- Fine-grained forward secrecy: allow-list/deny-list encryption and applications
- Generic constructions for fully secure revocable attribute-based encryption
- Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters
- Security-level switchable attribute-based encryption under the strictly weaker assumption family
- Efficient anonymous multi-group broadcast encryption
- Fast, compact, and expressive attribute-based encryption
- Compacting ciphertext in multi-channel broadcast 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 dynamic predicate compositions in ABE from standard assumptions
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings
- A study of pair encodings: predicate encryption in prime order groups
- Ciphertext-Policy Attribute-Based Broadcast Encryption with Small Keys
- Leakage-resilient functional encryption via pair encodings
- Linear encryption with keyword search
- Attribute Based Encryption with Direct Efficiency Tradeoff
- Non-zero inner product encryption with short ciphertexts and private keys
- Attribute-based encryption for range attributes
- Short attribute-based signatures for threshold predicates
- Threshold Ciphertext Policy Attribute-Based Encryption with Constant Size Ciphertexts
- Computationally efficient expressive key-policy attribute based encryption schemes with constant-size ciphertext
- Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption
- Dual system encryption framework in prime-order groups via computational pair encodings
- Efficient ciphertext policy attribute-based encryption with constant-size ciphertext and constant computation-cost
- Conjunctive Broadcast and Attribute-Based Encryption
- Fully collusion-resistant traceable key-policy attribute-based encryption with sub-linear size ciphertexts
- On the security of joint signature and encryption revisited
- Constant size ciphertexts in threshold attribute-based encryption
- Attribute-based encryption schemes with constant-size ciphertexts
- An efficient key-policy attribute-based encryption scheme with constant ciphertext length
- Attribute-based encryption with fast decryption
- Expressive Attribute Based Signcryption with Constant-Size Ciphertext
- Fast, compact, and expressive attribute-based encryption
- Public-key puncturable encryption: modular and compact constructions
- Homomorphic-policy attribute-based key encapsulation mechanisms
- Attribute-based encryption
- Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper)
- Generic Framework for Attribute-Based Group Signature
- Computational friendly attribute-based encryptions with short ciphertext
- Efficient fully secure attribute-based encryption schemes for general access structures
- A framework and compact constructions for non-monotonic attribute-based encryption
- Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
- Simplifying design and analysis of complex predicate encryption schemes
- A ciphertext-policy attribute-based encryption scheme with constant ciphertext length
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs
- TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks
- ABE for circuits with constant-size secret keys and adaptive security
- Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
- Attribute-based signatures for range of inner product and its applications
- Multi-client functional encryption with fine-grained access control
- 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
- CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
- Unbounded non-zero inner product encryption
- Predicate encryption with selective-opening security for receivers: formal definition, generic construction, and concrete instantiations for several primitives
- Anonymous attribute-based broadcast encryption with hidden multiple access structures
- Compact NIZKs from standard assumptions on bilinear maps
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Verifiability-based conversion from CPA to CCA-secure predicate encryption
- Efficient privacy-preserving data sharing mechanisms against malicious senders in smart grid
- Dynamic decentralized functional encryption: generic constructions with strong security
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Constant-size ciphertexts in threshold attribute-based encryption without dummy attributes
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
This page was built for publication: Expressive key-policy attribute-based encryption with constant-size ciphertexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084342)
