DENIABLE ATTRIBUTE BASED ENCRYPTION SYSTEM IN AN AUDIT-FREE CLOUD STORAGE

We consider the communitarian information distributing issue for anonym punch evenly apportioned information at different information suppliers. We consider another kind of "insider assault" by conniving information suppliers who may utilize their own information records (a subset of the general information) notwithstanding the outer foundation information to gather the information records contributed by other information suppliers. The paper tends to this new danger and makes a few commitments. To start with, we present the thought of m-security, which ensures that the anonymized information fulfills a given protection requirement against any gathering of up to m intriguing information suppliers. Second, we present heuristic calculations abusing the proportionality bunch monotonicity of protection imperatives and versatile requesting methods for effectively checking m-security given a bunch of records. At long last, we present an information supplier mindful anonymization calculation with versatile m-protection checking systems to guarantee high utility and m-security of anonymized information with effectiveness