Function private predicate encryption for low min-entropy predicates

DOI10.1007/978-3-030-17259-6_7MaRDI QIDQ2289430zbMATH OpenOpenAlexFDO

Authors Sikhar Patranabis, Debdeep Mukhopadhyay, Somindu C. Ramanna

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17259-6_7

zbMATH Keywords

prime-order bilinear pairingszero inner-product encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Unbounded predicate inner product functional encryption from pairings
• Inner-product encryption under standard assumptions
• Non-zero inner product encryption with short ciphertexts and private keys
• Functional encryption for inner product with full function privacy
• Fully secure unbounded zero inner product encryption with short ciphertexts and keys

Cited in

(9)

• Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
• Non-zero inner product encryption with short ciphertexts and private keys
• Constructing subspace membership encryption through inner product encryption
• Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
• Functional encryption against probabilistic queries: definition, construction and applications
• Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
• Updatable searchable symmetric encryption: definitions and constructions
• CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
• A public key identity-based revocation scheme: fully attribute-hiding and function private

This page was built for publication: Function private predicate encryption for low min-entropy predicates

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