Safest Secure and Consistent Data Services in the Storage of Cloud Computing

  • Geethu Mary George
  • L. S. Jayashree
Conference paper


Cloud computing is the greatest learning in the computing field and a dreamed vision of computing as a utility so to enjoy the on-demand high-quality applications. Cloud security is the critical factor that places an imperative role in maintaining the secure and reliable data services. In large-range cloud computing, a large pool of erasable, usable, and accessible virtualized resources are used as hardware development platforms and/or sources. These resources can be vigorously reconfigured to adjust a variable load allowing also for optimum resource utilization. The pool of resource is typically exploited by a peer-to-peer use model in which guarantees are presented by the infrastructure provided by means of customized service-level architecture (SLA).The hierarchical structure has been proven effective for solving data storage issues as well as data integrity by giving data protection during the full life span. Cloud computing is related to numerous technologies, and the convergence of diverse technologies has emerged to be called cloud computing. Storage in the cloud provides attractive cost and high-quality applications on large data storage. Security offerings and capability continue to increase and vary between cloud providers. Cloud offers greater convenience to users toward data because they will not bother about the direct hardware management. For security issues, a secret key is generated. Key consideration is to efficiently detect any unauthorized data corruption and modification which arises due to byzantine failures. Cloud service providers (CSP) are separate administrative entities, where data outsourcing is actually relinquishing user’s ultimate control over the fate of their data. As an outcome, the accuracy of the data in the cloud is being set at a high risk. In distributed cloud servers, all these inconsistencies are detected and data is guaranteed. The main proposed objective of this chapter is to develop an auditing mechanism with a homomorphic token key for security purposes. By using this secret token, we will easily be able to locate errors and also the root cause of the error. By the error recovery algorithm, we recover these corrupted files and locate the error.


Cloud computing Data storage security Error localization Data integrity Token generation Pseudorandom data 



Service-level architecture


Cloud service provider


Software as a service


Platform as a service


Infrastructure as a service


Service-level agreement


Third-party auditor


Cloud server


Galois field


Sobol random function


Sobol random permutation


Machine authenticated code


  1. 1.
    Wang C, Wang Q, Ren K, Lou W (2010) Privacy-preserving public auditing for storage security in cloud computing. In: Proceedings of IEEE INFOCOM’10, March, San Diego, CA, USAGoogle Scholar
  2. 2.
    Carter L, Wegman M (1979) Universal hash functions. J Comp Syst Sci 18(2):143–154. J. Kincaid,
  3. 3.
    Brately P, Fox BL (2007) Algorithm 659: implementing Sobol’s Quasi-random sequence generator. ACM Trans Math Softw 14(1):88–100. pp 1–6CrossRefGoogle Scholar
  4. 4.
    Erway C, Kupcu A, Papamanthou C, Tamassia R (2009) Dynamic provable data possession. In: Proceedings of CCS, March, pp 213–222Google Scholar
  5. 5.
    Juels A, Burton J, Kaliski S (2003) PORs: proofs of Retrievability for large files. In: Proceedings of CCS ‘07, pp 584–597, Plank JS, Ding Y (2007) Note: correction to the 1997 tutorial on reed-Solomon codingGoogle Scholar
  6. 6.
    Carter L, Wegman M (1979) Universal hash unctions. J Comput Syst Sci 18(2):143–154CrossRefGoogle Scholar
  7. 7.
    Verifying distributed Erasurecoded data. In: Proceedings of the 26th ACM ymposium on principles of distributed computing, pp 139–146, 2007Google Scholar
  8. 8.
    Wang C, Chow SSM, Lou W (2011) Privacy Preserving Public Auditing for Secure Cloud Storage. In Ubisec Lab, IIT, IEEE Transactions on Computers (TC)Google Scholar
  9. 9.
    Castro M, Liskov B 2008 Practical byzantine fault tolerance and practical recovery. ACM Transaction, JuneGoogle Scholar
  10. 10.
    Bowers KD, Juels A, Oprea A (2008) Proofs of retrievability: theory and implementationGoogle Scholar
  11. 11.
    Wang C, Wang Q, Ren K, Lou W (2009) Ensuring data storage security in cloud computing. In: Proceedings of IWQoS’09, July, pp 1–9Google Scholar
  12. 12.
    Carter L, Wegman M (1979) Universal hash functions. J Comp Syst Sci 18(2):143–154. J. Kincaid,
  13. 13.
    Ateniese G, Pietro RD, Mancini LV, Tsudik G (2008) Scalable and efficient provable data possession. In: Proceedings of the Fourth Int’l Conference in Communication Networks (Secure Comm ‘08), December, pp 1–10Google Scholar
  14. 14.
    Brately P, Fox BL (1988) Algorithm 659: implementing Sobol’s quasi- random sequence generator. ACM Trans Math Softw 14(1):88–100CrossRefGoogle Scholar
  15. 15.
    Shah MA, Baker M, Mogul JC, Swaminathan R (2007) Auditing to keep online storage services honest. In: Proceedings of 11th USENIX workshop on hot topics in operating systems (HOTOS ‘07), pp. 1–6Google Scholar
  16. 16.
    Plank JS, Ding Y Note: correction to the 1997 tutorial on reed-Solomon coding. University of Tennessee, tech. Rep. CS-03-504, September 2003Google Scholar
  17. 17.
    Wang C, Ren K, Lou W, Li J (2010) Towards publicly auditable secure cloud data storage services. IEEE Netw Mag 24(4):19–24CrossRefGoogle Scholar
  18. 18.
    Ren K, Wang C, Wang Q (2012) Security challenges for the public cloud. IEEE Internet Comput 16(1):69–73MathSciNetCrossRefGoogle Scholar
  19. 19., “Amazon web services (aws),” Online at, 2009.Smitha Sundareswaran, Anna Squicciarini,“Ensuring distributedaccountability for data sharing in the cloud, vol. 9, No. 4, July 2012
  20. 20.
    Wang Q, Wang C, Li J, Ren K, Lou W Enabling public verifiability and data dynamics for storage security in cloud computing, Sep 2009.Google Scholar
  21. 21.
    Wang Q, Ren K, Lou W, Zhang Y Dependable and secure sensor data storage with dynamic integrity assurance. In: Proceedings of IEEE INFOCOM’09, Rio de Janeiro, Brazil, April 2009.Google Scholar
  22. 22.
    Hendricks J, Ganger G, Reiter M (2007) Verifying distributed erasure-coded data. In 26th ACM, MarchGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Geethu Mary George
    • 1
  • L. S. Jayashree
    • 1
  1. 1.Department of Computer Science and EngineeringPSG College of TechnologyCoimbatoreIndia

Personalised recommendations