Description

The privacy of users must be considered as the utmost priority in distributed networks. To protect the identities of users, attribute-based encryption (ABE) was presented by Sahai et al. ABE has been widely used in many scenarios, particularly in cloud computing. In this paper, public key encryption with equality test is concatenated with key-policy attribute-based encryption (KP-ABE) to present key-policy attribute-based encryption with equality test (KP-ABEwET). The proposed scheme not only offers fine-grained authorization of ciphertexts but also protects the identities of users. In contrast to attribute-based encryption with keyword search, KP-ABEwET can test whether the ciphertexts encrypted by different public keys contain the same information. Moreover, the authorization process of the presented scheme is more flexible than that of Ma et al.’s scheme. Furthermore, the proposed scheme achieves one-way against chosen-ciphertext attack (OW-CCA) based on the bilinear Diffie-Hellman (BDH) assumption. In addition, a new computational problem called the twin-decision bilinear Diffie-Hellman problem (tDBDH) is proposed in this paper. tDBDH is proven to be as hard as the decisional bilinear Diffie-Hellman problem. Finally, for the first time, the security model of authorization is provided, and the security of authorization based on t