Efficiently multi-user searchable encryption scheme with attribute revocation and grant for cloud storage

14Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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 attributebased encryption scheme is a new challenge. In this paper, we propose an efficiently multiuser 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.

Cite

CITATION STYLE

APA

Wang, S., Zhang, X., & Zhang, Y. (2016). Efficiently multi-user searchable encryption scheme with attribute revocation and grant for cloud storage. PLoS ONE, 11(11). https://doi.org/10.1371/journal.pone.0167157

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free