Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
From MaRDI portal
Publication:3562910
DOI10.1007/978-3-642-13013-7_23zbMath1281.94013OpenAlexW1769443955MaRDI QIDQ3562910
Benoît Libert, Nuttapong Attrapadung
Publication date: 28 May 2010
Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_23
Related Items (33)
Public-Key Puncturable Encryption: Modular and Compact Constructions ⋮ Towards semantically secure outsourcing of association rule mining on categorical data ⋮ Cross-domain attribute-based access control encryption ⋮ Generic constructions for fully secure revocable attribute-based encryption ⋮ Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ Spatial encryption supporting non-monotone access structure ⋮ 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 ⋮ Attribute-based encryption schemes with constant-size ciphertexts ⋮ Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters ⋮ Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ The relation and transformation between hierarchical inner product encryption and spatial encryption ⋮ Compact (Targeted Homomorphic) Inner Product Encryption from LWE ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ Verifiability-based conversion from CPA to CCA-secure predicate encryption ⋮ Leakage-resilient attribute based encryption in prime-order groups via predicate encodings ⋮ Doubly spatial encryption from DBDH ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ 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 ⋮ Predicate signatures from pair encodings via dual system proof technique ⋮ Leakage-Resilient Functional Encryption via Pair Encodings ⋮ Optimal broadcast encryption from pairings and LWE ⋮ More Efficient Constructions for Inner-Product Encryption ⋮ Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant Computation-Cost ⋮ Anonymous Encryption with Partial-Order Subset Delegation Functionality ⋮ Generic negation of pair encodings ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ Attribute-Based Encryption for Range Attributes ⋮ Efficient fully CCA-secure predicate encryptions from pair encodings ⋮ Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting
This page was built for publication: Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
