DYNAMIC APPROACH FOR SECURE DEDUPLICATION OF DATA OVER THE COLUD

Information deduplication is one of critical information pressure methods for killing copy duplicates of rehashing information and has been broadly utilized as a part of distributed storage keeping in mind the end goal to minimize the measure of storage room and spare transfer speed. For insurance of information security, this paper makes an endeavor to basically address the issue of approved information deduplication. To secure the classification of imperative information while supporting deduplication, the concurrent encryption system has been proposed to scramble the information before outsourcing. Alongside the information the benefit level of the client is additionally checked so as to guarantee whether he is an approved client or not. Security investigation exhibits that our plan is secure regarding the definitions indicated in the proposed security display. We demonstrate that our proposed approved copy check plot has negligible overhead contrasted with ordinary operations. As a proof of idea, we execute a model of our proposed approved copy check plan and direct tried analyses utilizing our model. This paper tries to minimize the information duplication that happens in half breed distributed storage by utilizing different strategies