Unbounded Predicate Inner Product Functional Encryption from Pairings
Abstract
References
Recommendations
Function-Hiding Zero Predicate Inner Product Functional Encryption from Pairings
Information SecurityAbstractIn this work, we investigate the possibility of constructing function-hiding predicate functional encryption (FH-P-FE), which provides full attribute-hiding and function-hiding securities. Concretely, the security of FH-P-FE guarantees that (1), ...
Constructing Pairing Free Unbounded Inner Product Functional Encryption Schemes with Unbounded Inner Product Policy
Innovative Security Solutions for Information Technology and CommunicationsAbstractInner product functional encryption (IPFE) is a promising advanced cryptographic primitive for the inner product function class that facilitates fine-grained access control of sensitive data in an untrusted cloud environment and has an expanding ...
Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation
PKC'10: Proceedings of the 13th international conference on Practice and Theory in Public Key CryptographyIn functional encryption (FE) schemes, ciphertexts and private keys are associated with attributes and decryption is possible whenever key and ciphertext attributes are suitably related. It is known that expressive realizations can be obtained from a ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Author Tags
Qualifiers
- Research-article
Funding Sources
- University of St.Gallen
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in