REDUCE THE DIVISION COST OF OUTSOURCE AND HIGH COMPUTATION LOAD TO CLOUD SERVICE PROVIDERS WITHOUT DISCLOSE FILE CONTENT AND SECRET KEYS

Abstract

To explain this attack, a concrete instance is offered. We prove the safety in our plan underneath the divisible computation Diffie-Hellman (DCDH) assumption. Regrettably, ABE plan requires high computation overhead during performing file encryption and understanding operations. Within the existing plan, whenever a user leaves from the user group, the audience manager only revokes his group secret key which means the user’s private key connected with attributes continues to be valid. Our plan is appropriate for resource restricted devices. If a person within the group intentionally exposes the audience secret answer to the revoked user, he is able to perform understanding operations through his private key. This defect gets to be more severe for lightweight devices because of their restricted computing sources. Within this system, we concentrate on designing a Club penguin-ABE plan with efficient user revocation for cloud storage system. aused by our experiment shows computation cost for local devices is comparatively low and could be constant. We try to model collusion attack done by revoked users cooperating with existing users. In addition, we construct a competent user revocation Club penguin-ABE plan through increasing the existing plan and prove our plan is CPA secure underneath the selective model.