Research Of Attribute-based Encryption Scheme With Efficient Revocation

With the development of cloud computing,attribute-based encryption technology because of its flexible access control has become one of the research focus in the cloud storage security issues.Compared with the traditional public key encryption,attribute-based encryption uses a flexible way of encryption,which is a kind of access control technology to ensure the data security in the cloud.Revocable attribute-based encryption is the extension and expansion of attribute-based encryption.As more and more individuals and businesses to outsource their data on cloud server,it is a very helpful cryptographic tool to deal with attribute change.Revocation mechanism is a basic requirement in practical application.Also,it is an inevitable direction of development of attribute-based encryption.With the extensive application of this technology,in this paper,we study the revocable attribute-based encryption and show the results as follow:We construct an efficient revocable attribute-based encryption scheme from lattices.It is a ciphertext-policy attribute-based encryption scheme supporting direct revocation and attribute change.We demonstrate that our construction is indistinguishability against selective ciphertext-policy and chosen ciphertext attack(IND-sCP-CCA)secure in the standard model under the LWE assumption,which is as hard as the worst-case approximation of short vectors on arbitrary lattices.We propose a searchable attribute based encryption scheme with efficient revocation.It is a ciphertext-policy attribute-based encryption scheme which adopts LSSS policy.Our construction can resist the collusion attack.To improve the efficiency,our scheme only requires to update those components associated with the revoked attribute of the ciphertext.Also,we move the workload of ciphertext update to the cloud sever.Finally,we demonstrate that our construction is indistinguishability against selective ciphertext-policy and chosen plaintext attack(IND-sCP-CPA)secure under the q-parallel DBDHE assumption.And,indistinguishability against selective keywords index and chosen plaintext attack secure under the Diffie-Hellman assumption.Also,indistinguishability against a chosen keyword attack secure under the Hash Diffie-Hellman assumption.