z-logo
open-access-imgOpen Access
Data Storage and Retrieval with Deduplication in Secured Cloud Storage
Author(s) -
S. Muthurajkumar
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.e7371.109119
Subject(s) - data deduplication , computer science , cloud storage , upload , cloud computing , encryption , database , computer data storage , computer network , overhead (engineering) , computer security , operating system
The Cloud Storage can be depicted as a service model where raw or processed data is stored, handled, and backed-up remotely while accessible to multiple users simultaneously over a network. Few of the ideal features of cloud storage is reliability, easy deployment, disaster recovery, security for data, accessibility and on top of that lesser overall storage costs which removes the hindrance of purchasing and maintaining the technologies for cloud storage. In this modern technology world, massive amount of data are produced in day to day life. So, it has become necessary to handle those big data on demand which is a challenging task for current data storage systems. The process of eliminating redundant copies of data thereby reducing the storage overhead is termed as Data Deduplication (DD). One of the ultimate aim of this research is to achieve ideal deduplication on secured data of client side. On the other hand as the client’s data are encrypted with different keys, the cross user deduplication is merely impossible as having a single key encryption among multiple user’s leads to an in secure system resulting in fragile to client’s expectations. The proposed research adapts Message Locked Encryption (MLE) technique that looks for redundant files in cloud before uploading the client’s file which eventually reduces the storage. Since the redundant files are swept, the network bandwidth is considerably reduced with respect to the redundant contents uploaded several times.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here