Secure and Constant Cost Public Cloud Storage Auditing with Deduplication

Information uprightness and capacity effectiveness are two essential necessities for distributed storage. Verification of Retrievability (POR) and Confirmation of Information Ownership (PDP) strategies guarantee information respectability for distributed storage. Evidence of Proprietorship (POW) enhances stockpiling proficiency by safely evacuating superfluously copied the information on the capacity server. Be that as it may, an insignificant blend of the two systems, with a specific end goal to accomplish both information trustworthiness and capacity proficiency, brings about non-minor duplication of metadata (i.e., validation labels), which repudiates the destinations of POW. Late endeavors to this issue present huge computational and correspondence costs and have likewise been demonstrated not secure. It requires another answer for bolster effective and secure information trustworthiness inspecting with capacity deduplication for distributed storage. In this paper, we take care of this open issue with a novel plan in view of strategies including polynomial-based validation labels and homomorphic straight authenticators. Our plan permits deduplication of both documents and their relating confirmation labels. Information respectability examining and capacity deduplication are accomplished all the while. Our proposed plan is likewise portrayed by consistent ongoing correspondence and computational cost on the client side. Open inspecting and group reviewing are both upheld. Henceforth, our proposed conspire beats existing POR and PDP plans while giving the extra usefulness of deduplication. We demonstrate the security of our proposed conspire in light of the Computational Diffie-Hellman issue, the Static Diffie-Hellman issue, and the t-Solid Diffie-Hellman issue. Numerical investigation and trial come about on Amazon AWS demonstrate that our plan is proficient and versatile.