title: Efficiently Multi-User Searchable Encryption Scheme with Attribute Revocation and Grant for Cloud Storage.
abstract: Cipher-policy attribute-based encryption (CP-ABE) focus on the problem of access control, and keyword-based searchable encryption scheme focus on the problem of finding the files that the user interested in the cloud storage quickly. To design a searchable and attribute-based encryption scheme is a new challenge. In this paper, we propose an efficiently multi-user searchable attribute-based encryption scheme with attribute revocation and grant for cloud storage. In the new scheme the attribute revocation and grant processes of users are delegated to proxy server. Our scheme supports multi attribute are revoked and granted simultaneously. Moreover, the keyword searchable function is achieved in our proposed scheme. The security of our proposed scheme is reduced to the bilinear Diffie-Hellman (BDH) assumption. Furthermore, the scheme is proven to be secure under the security model of indistinguishability against selective ciphertext-policy and chosen plaintext attack (IND-sCP-CPA). And our scheme is also of semantic security under indistinguishability against chosen keyword attack (IND-CKA) in the random oracle model.
authors.affiliation: School of Science, Xi'an University of Technology, Xi'an, Shaanxi, China.
authors.forename: Shangping
authors.initials: S
authors.lastname: Wang
authors.affiliation: School of Science, Xi'an University of Technology, Xi'an, Shaanxi, China.
authors.forename: Xiaoxue
authors.initials: X
authors.lastname: Zhang
authors.affiliation: School of Computer Science and Engineering, Xi'an University of Technology, Xi'an, Shaanxi, China.
authors.forename: Yaling
authors.initials: Y
authors.lastname: Zhang
mesh_terms: D000465:Algorithms; D000067917:Cloud Computing; D016494:Computer Security; D066275:Health Information Exchange; D006801:Humans; D016247:Information Storage and Retrieval / Q000379:methods*; D008962:Models, Theoretical