Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption

DOI10.1007/978-3-319-10879-7_17MaRDI QIDQ2922664zbMATH OpenOpenAlexFDO

Authors Katsuyuki Takashima

Publication date 14 October 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10879-7_17

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Expressive key-policy attribute-based encryption with constant-size ciphertexts
• Attribute-based encryption schemes with constant-size ciphertexts
• Computationally efficient expressive key-policy attribute based encryption schemes with constant-size ciphertext
• Computational friendly attribute-based encryptions with short ciphertext
• Constant size ciphertexts in threshold attribute-based encryption

Cited in

(22)

• Fully secure functional encryption with a large class of relations from the decisional linear assumption
• Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing
• New proof techniques for DLIN-based adaptively secure 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
• A study of pair encodings: predicate encryption in prime order groups
• Attribute Based Encryption with Direct Efficiency Tradeoff
• Verifiable functional encryption
• Dual system encryption framework in prime-order groups via computational pair encodings
• Expressive key-policy attribute-based encryption with constant-size ciphertexts
• Bilinear entropy expansion from the decisional linear assumption
• Post-Quantum Constant-Round Group Key Exchange from Static Assumptions
• Expressive Attribute Based Signcryption with Constant-Size Ciphertext
• Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
• On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
• Broadcast, trace and revoke with optimal parameters from polynomial hardness
• 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
• Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts
• Unbounded dynamic predicate compositions in ABE from standard assumptions
• A bunch of broken schemes: a simple yet powerful linear approach to analyzing security of attribute-based encryption

This page was built for publication: Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922664)