Efficient Approach for Data Retrievability on Cloud Storage Systems

Authors

  • Priya A  Department of Computer Science and Engineering, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India
  • Meena T  Department of Computer Science and Engineering, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India
  • Devi M  Department of Computer Science and Engineering, Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India

Keywords:

Data Retrievability, Providing Security, Creating Blocks, Network Encoding

Abstract

Cloud storage is a model of data storage in which the digital data is stored in logical pools. It allows users to store their data in a remote server to get rid of expensive local storage and management costs and then 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 and encode that data block using network coding. To eliminate the communication overhead for small data corruptions within a server, each 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 for the effectiveness of the proposed construction in defending against attacks during data retrievability.

References

  1. P. Mell and T. Grance, “Draft NIST working definition of cloud compu-ting,” Referenced on June. 3rd, 2009 Online at http://csrc.nist.gov/groups/SNS/cloud- computing/index. html, 2009.
  2. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoi-ca, and M. Zaharia, “Above the clouds: A berkeley view of cloud computing,” University of California, Berkeley, Tech. Rep. UCB-EECS-2009-28, Feb 2009.
  3. M. Arrington, “Gmail disaster: Reports of mass email deletions,” Online at http://www.techcrunch.com/2006/ 12/28/gmail- disasterreports- of- mass- email- deletions/, December 2006.
  4. J. Kincaid, “MediaMax/TheLinkup Closes Its Doors,” Online at http://www.techcrunch.com/2008/07/10/ mediamaxthelinkup- closes- its- doors/, July 2008.
  5. A. L. Ferrara, M. Greeny, S. Hohen-berger, and M. Pedersen, “Practical short signature batch verifica-tion,” in Proceedings of CT-RSA, volume 5473 of LNCS. Springer-Verlag, 2009, pp. 309– 324.
  6. M. A. Shah, R. Swaminathan, and M. Baker, “Privacy- preserving audit and extraction of digital contents,” Cryptol- ogy ePrint Archive,Report 2008.
  7. C. Erway, A. Kupcu, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in Proc. of CCS’09, 2009, pp. 213– 222.
  8. 104th United States Congress, “Health Insurance Portability and Accountability Act of 1996 (HIPPA),” Online at http:// aspe.hhs.gov/ admnsimp/pl104191.htm, 1996.
  9. R. C. Merkle, “Protocols for public key cryptosystems,” in Proc. of IEEE Symposium on Security and Privacy, Los Alamitos, CA, USA, 1980.
  10. Y. Dodis, S. P. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in TCC, 2009, pp. 109–127.
  11. Cloud Security Alliance, “Se-curity guidance for critical areas of focus in cloud computing,” 2009, http:// www. cloudsecurityalliance.org.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2017-12-31

Issue

Volume 2, Issue 2, March-April-2016

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Priya A, Meena T, Devi M, " Efficient Approach for Data Retrievability on Cloud Storage Systems, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 2, pp.408-412, March-April-2016.