STABLE WORDING LOOK FOR ENCRYPTED DISTORT CACHE
Ketavath Jabbarlal, Kasuba Tulasi · IJITR International Journal of Innovative Technology and Research - IJITR International Journal of Innovative Technology and Research · 2018
Within the existing plan, each time a user leaves the user group, the audience manager repeats their group secret key, which means that the user's private key associated with the properties is still valid. Our plan is suitable for devices with limited resources. If a person within the group intentionally exposes the secret response of the audience to the recalled user, they can perform comprehension activities through their private key. To explain this attack, a specific example is presented. We demonstrate security in our plan under the divisible Diffie-Hellman calculation assumption (DCDH). Unfortunately, the ABE plan requires a large calculation overload when file encryption and comprehension operations are performed. This defect becomes more serious for the light devices due to the limited computer resources. Within this system, we focus on the design of a Club Penguin-ABE plan with the effective revocation of the cloud storage system user. The cause of our experiment shows that local computing costs are relatively low and can be constant. We are trying to create a merger attack made by recalled users who work with existing users. In addition, we have built a skilled user revocation plan for the Penguin-ABE club by increasing the existing plan and showing that our plan is a safe CPA under the selective model.