isrjournals
User Sign in    Editor Sign in

efficient approach for data retrievability in cloud storage sysytem

Priyanka T,Vishali C,R. K. Selvakumar

Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology

ISSN: 2321-3337          Impact Factor:1.521         Volume:4         Issue:3         Year: 01 April,2016         Pages:760-766

International Journal of Advanced Research in Computer Science Engineering and Information Technology

Abstract

Cloud computing is basically internet based computing where the virtual shared sources provide the users with software,infrastructure,platform,devices and other resources.It allows users to store their data in a remote server to get less expensive local storage and management costs so that they can access data of interest anytime anywhere.We propose an enhanced dynamic proof of retrievability scheme supporting public audit ability and communication-efficient recovery from data corruptions. We split up the data into small data blocks using network coding and encode that data block using Base64. To eliminate the communication overhead for small data corruptions within a server, each encoded data block is further encoded. Based on the encoded data blocks, we utilize tree structure to enforce the data sequence for dynamic operations, preventing the cloud service provider from manipulating data block to pass the integrity check in the dynamic scenario. We also analyze the effectiveness of the proposed construction in defending against pollution attacks during data retrievability.

Kewords

Proof of retrievability, Cloud service provider, Communication overhead, Public audibility, Data Corruptions.

Reference

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems Zhengwei Ren, Lina Wang, Qian Wang, Member, IEEE, Rongwei Yu, and Ruyi Deng Y. Zhu, H. Wang, Z. Hu, G.J. Ahn, and H. Hu, Zero-knowledge Proofs of Retrievability,, Science China: Information Sciences, vol. 54, no. 8, pp. 1608-1617, 2011. Z. Mo, Y. Zhou, and S. Chen. A dynamic proof of retrievability (por) scheme with o(log n) complexity. In ICC12, pages 912–916, 2012 E. Shi, E. Stefanov, and C. Papamanthou. Practical dynamic proofs of retrievability.Technical report, 2013. Q. Zheng and S. Xu. Fair and dynamic proofs of retrievability.In CODASPY, 2011. Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li. Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans. Parallel Distrib. Syst., 22(5):847–859, 2011