Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
From MaRDI portal
Publication:2922664
DOI10.1007/978-3-319-10879-7_17zbMath1378.94065OpenAlexW131146259MaRDI QIDQ2922664
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
Related Items (16)
On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Verifiable Functional Encryption ⋮ Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ 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 ⋮ Succinct and adaptively secure ABE for ABP from \(k\)-Lin ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Fully secure functional encryption with a large class of relations from the decisional linear assumption ⋮ A Study of Pair Encodings: Predicate Encryption in Prime Order Groups ⋮ Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing ⋮ Post-Quantum Constant-Round Group Key Exchange from Static Assumptions ⋮ Attribute Based Encryption with Direct Efficiency Tradeoff
This page was built for publication: Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
