z-logo
open-access-imgOpen Access
Optimizing the Algorithm for Secure and Dynamic Cloud Storage using MHT
Author(s) -
Amit Kumar,
Santosh S. Sambare
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/20155-2301
Subject(s) - computer science , cloud computing , algorithm , data mining , operating system
With the consistently increasing demand of storing data backup online by millions of users, cloud computing which provides resources both hardware and software as a service through a network (usually internet) has gained much momentum and attention. Storing data on cloud services relieves the user from the task of storing data locally. As beneficial as it sounds, cloud storage comes along with the quintessential need to protect the stored data from threats such as loss of confidential data and denial of service. The purpose of this research paper is provide a mechanism which uses tokens and distributed forward error correction coded data. The mechanism not only provides the assurance of a secure storage but also provides with the identification of error or the wrongful server simultaneously. Considering the user to store data dynamically, we have also felicitated the dynamic operations such as insertion, deletion and appending blocks. In comparison to previous works, our algorithm can be more flexible with the use of Merkle Hash Tree (MHT) rather than contiguous block data structure.

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
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom