An Efficient Predicate Encryption with Constant Pairing Computations and Minimum Costs

Predicate encryption is a public-key encryption that supports attribute-hiding as well as payload-hiding and achieves high flexibility in terms of access control. Since Katz, Sahai, and Waters first proposed the predicate encryption scheme in 2008, several predicate encryption schemes have been published. Unfortunately these are impractical as they require $O(n)$ pairing computations for decryption with considerably large sized public parameters, secret key, and ciphertext, where $n$ is the dimension of the attribute/predicate vectors. In this paper, we propose a very efficient predicate encryption scheme that requires only $n$ exponentiation plus three pairing computations for decryption with shorter sized public parameters, secret key, and ciphertext. The proposed scheme is proven selective attribute-secure against chosen-plaintext attacks in the standard model under the Asymmetric Decisional Bilinear Diffie-Hellman assumptions.