Private Predicate Encryption for Inner Product from Key-Homomorphic Pseudorandom Function

Abstract

Predicate encryption (PE), formalized by Katz et al., is a new paradigm of public-key encryption that conceptually captures the public-key encryption that supports fine-grained access control policy. Because of the nature of PE, it is used for cloud storage so that users can retrieve encrypted data without revealing any information about the data to cloud servers and other users. Although lots of PE schemes have been studied, the predicate-hiding security is seldom considered; that is, the user’s secret key may leak sensitive information of the predicate. Additionally, the security of the current predicate-hiding PE schemes relies on the discrete logarithm assumption which cannot resist the quantum attacks in the future. In this paper, we propose a generic PE for inner product under symmetric-key setting, called private IPE, from specific key-homomorphic pseudorandom function (PRF). The rigorous proofs are provided to show that the construction is payload-hiding, attribute-hiding, and predicate-hiding secure. With the advantage of the generic construction, if the underlying PRF can resist quantum attacks, then, through our proposed generic construction, a quantum-resistant private IPE can be obtained.

Efficient Multibit Function Encryption for Data Security in Internet of Things

“…Working Department: IT AND(Job Position : Technician OR Age : Under 30). (20) It can be written as such a polynomial:…”

“…Subsequently, there are many applications about the IoT [7][8][9][10][11][12][13][14][15][16][17][18][19]. And some predicate encryption schemes [20,21] and ABE schemes [22,23] have been proposed, but these are based on bilinear groups and cannot resist quantum attacks. Nowadays, there are more and more intelligent applications [24][25][26][27][28][29][30].…”