Open Access Open Access  Restricted Access Subscription Access

CDINS: Cooperative Provable Data Possession for Integrity Verification in Network-Coding-Based Multi Cloud Storage System


 

Cloud Computing has improved in its existence, when compared to grid computing and cluster computing by providing an optimized and economical solution for sharing group resources among the cloud users. Persistent data, maintaining privacy in an untrusted cloud is still a demanding issue. In this paper we propose a secure owner, data sharing using advance encryption standard (AES), and splitting the data using remote file synchronization single round algorithm (RSYNC), data migration between clouds is an important feature. Here we use proxy based storage for fault tolerance in multiple-cloud storage called network coding, which overcomes, problems such as loss of data, permanent failure. In our scheme we represent five cloud servers, four cloud servers provide the requested data to end-user, if the data is hacked or deleted, the storage regenerating code (SR) retrieves the data from the fifth cloud server and delivers to end-user. A graph is plotted for the total time taken for the regenerating code. The main feature of SR code is that we release the encoding requirement of storage nodes during repair, to make regenerating code portable for any cloud storage. In addition, we analyze the security of our scheme with rigorous proofs and demonstration the efficiency of our scheme in experiments.

Cloud Computing has improved in its existence, when compared to grid computing and cluster computing by providing an optimized and economical solution for sharing group resources among the cloud users. Persistent data, maintaining privacy in an untrusted cloud is still a demanding issue. In this paper we propose a secure owner, data sharing using advance encryption standard (AES), and splitting the data using remote file synchronization single round algorithm (RSYNC), data migration between clouds is an important feature. Here we use proxy based storage for fault tolerance in multiple-cloud storage called network coding, which overcomes, problems such as loss of data, permanent failure. In our scheme we represent five cloud servers, four cloud servers provide the requested data to end-user, if the data is hacked or deleted, the storage regenerating code (SR) retrieves the data from the fifth cloud server and delivers to end-user. A graph is plotted for the total time taken for the regenerating code. The main feature of SR code is that we release the encoding requirement of storage nodes during repair, to make regenerating code portable for any cloud storage. In addition, we analyze the security of our scheme with rigorous proofs and demonstration the efficiency of our scheme in experiments.


Keywords

Cloud Computing, Cloud Server, Data Sharing, Experiment, Implementation, Storage Regeneration Code
User
Notifications
Font Size

Abstract Views: 173

PDF Views: 0




  • CDINS: Cooperative Provable Data Possession for Integrity Verification in Network-Coding-Based Multi Cloud Storage System

Abstract Views: 173  |  PDF Views: 0

Authors

Abstract


Cloud Computing has improved in its existence, when compared to grid computing and cluster computing by providing an optimized and economical solution for sharing group resources among the cloud users. Persistent data, maintaining privacy in an untrusted cloud is still a demanding issue. In this paper we propose a secure owner, data sharing using advance encryption standard (AES), and splitting the data using remote file synchronization single round algorithm (RSYNC), data migration between clouds is an important feature. Here we use proxy based storage for fault tolerance in multiple-cloud storage called network coding, which overcomes, problems such as loss of data, permanent failure. In our scheme we represent five cloud servers, four cloud servers provide the requested data to end-user, if the data is hacked or deleted, the storage regenerating code (SR) retrieves the data from the fifth cloud server and delivers to end-user. A graph is plotted for the total time taken for the regenerating code. The main feature of SR code is that we release the encoding requirement of storage nodes during repair, to make regenerating code portable for any cloud storage. In addition, we analyze the security of our scheme with rigorous proofs and demonstration the efficiency of our scheme in experiments.

Cloud Computing has improved in its existence, when compared to grid computing and cluster computing by providing an optimized and economical solution for sharing group resources among the cloud users. Persistent data, maintaining privacy in an untrusted cloud is still a demanding issue. In this paper we propose a secure owner, data sharing using advance encryption standard (AES), and splitting the data using remote file synchronization single round algorithm (RSYNC), data migration between clouds is an important feature. Here we use proxy based storage for fault tolerance in multiple-cloud storage called network coding, which overcomes, problems such as loss of data, permanent failure. In our scheme we represent five cloud servers, four cloud servers provide the requested data to end-user, if the data is hacked or deleted, the storage regenerating code (SR) retrieves the data from the fifth cloud server and delivers to end-user. A graph is plotted for the total time taken for the regenerating code. The main feature of SR code is that we release the encoding requirement of storage nodes during repair, to make regenerating code portable for any cloud storage. In addition, we analyze the security of our scheme with rigorous proofs and demonstration the efficiency of our scheme in experiments.


Keywords


Cloud Computing, Cloud Server, Data Sharing, Experiment, Implementation, Storage Regeneration Code