Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation

DOI10.1007/978-3-642-13013-7_23MaRDI QIDQ3562910zbMATH OpenOpenAlexFDO

Authors Nuttapong Attrapadung, Benoît Libert

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

zbMATH Keywords

efficiencyfunctional encryptionidentity-based broadcast encryptionrevocation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Functional encryption for public-attribute inner products: achieving constant-size ciphertexts with adaptive security or support for negation
• Functional encryption for inner product with full function privacy
• Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
• Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
• More efficient constructions for inner-product encryption

Cited in

(42)

• Leakage-resilient attribute based encryption in prime-order groups via predicate encodings
• Predicate signatures from pair encodings via dual system proof technique
• Optimal broadcast encryption from pairings and LWE
• Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
• Generic negation of pair encodings
• Efficient fully CCA-secure predicate encryptions from pair encodings
• Cross-domain attribute-based access control encryption
• Generic constructions for fully secure revocable attribute-based encryption
• Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters
• Doubly spatial encryption from DBDH
• The relation and transformation between hierarchical inner product encryption and spatial encryption
• Towards semantically secure outsourcing of association rule mining on categorical data
• Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
• Direct computation of branching programs and its applications to more efficient lattice-based cryptography
• Leakage-resilient functional encryption via pair encodings
• More efficient constructions for inner-product encryption
• Non-zero inner product encryption with short ciphertexts and private keys
• Attribute-based encryption for range attributes
• Achieving short ciphertexts or short secret-keys for adaptively secure general 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
• Functional encryption for public-attribute inner products: achieving constant-size ciphertexts with adaptive security or support for negation
• Ciphertext-policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting
• Compact (targeted homomorphic) inner product encryption from LWE
• Spatial encryption supporting non-monotone access structure
• Attribute-based encryption schemes with constant-size ciphertexts
• Improved (hierarchical) inner-product encryption from lattices
• Public-key puncturable encryption: modular and compact constructions
• Anonymous spatial encryption under affine space delegation functionality with full security
• 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
• 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
• 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
• A public key identity-based revocation scheme: fully attribute-hiding and function private
• Verifiability-based conversion from CPA to CCA-secure predicate encryption
• \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
• Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption

This page was built for publication: Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation

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