Cluster Computing

, Volume 22, Supplement 3, pp 6927–6935 | Cite as

Cloud data integrity checking using bilinear pairing and network coding

  • V. BalasubramanianEmail author
  • T. Mala


Nowadays the user uses cloud storage to store their files. The cloud server provides excellent cloud services that is scalable. Also, the users is provided with the ability to share their data files with other users. The cloud service providers are not considered to be reliable. Since the stored data might be shared among multiple users, the integrity of the file remains a serious concern. Henceforth, examination of the integrity and dependability of data in the cloud becomes inevitable. Most of the remote data auditing schemes available validate the integrity of the data, nevertheless, it does not support data recovery, if data are lost or corrupted. Network coding based encoding can be used to support data recovery. In this paper, we intend a novel remote integrity scrutiny scheme which can be used to check data integrity as well as it facilitates data recovery.


Data integrity Network coding Cloud storage Auditing 


  1. 1.
    Zhou, Z., Huang, D.: Efficient and secure data storage operations for mobile cloud computing. In: 8th International Conference on Network and Service Management and 2012 Workshop on Systems Virtualization Management, pp. 37–45, IEEE Press, Las Vegas (2012)Google Scholar
  2. 2.
    Cong, W., Qian, W., Kui, R., Wenjing, L.: Ensuring data storage security in Cloud Computing. In: 17th International Workshop on Quality of Service, pp. 1–9, IEEE Press, Charleston, SC (2009)
  3. 3.
    Wang, W., Li, Z., Owens, R., Bhargava, B.: Secure and efficient access to outsourced data. In: 2009 ACM Workshop on Cloud Computing Security, pp. 55–66, ACM Press, New York (2009)
  4. 4.
    Xiao, Z., Xiao, Y.: Security and privacy in cloud computing. J. IEEE Commun. Surv. Tutor. 15, 843–859 (2013). CrossRefGoogle Scholar
  5. 5.
    Nancy, G.: Amazon’s S3 down for several hours, (2008). Accessed 05 Nov 2016
  6. 6.
    Michael, A.: Gmail Disaster: Reports of Mass Email Deletions (2006). Accessed 07 March 2017
  7. 7.
    Ateniese, G., Di Pietro, R., Mancini, L., Tsudik, G.: Scalable and efficient provable data possession. In: 4th International Conference on Security and Privacy in Communication Networks, Istanbul, Turkey, pp. 1–10, ACM Press, New York (2008)
  8. 8.
    Ateniese, G., Burns, R., Curtmola, R., Herring, J., Khan, O., Kissner, L., Peterson, Z., Song, D.: Remote data checking using provable data possession. Trans. Inf. Syst. Secur. 14, 1–34 (2011). CrossRefGoogle Scholar
  9. 9.
    Chen, L.: Using algebraic signatures to check data possession in cloud storage. Future Gener. Comput. Syst. 29, 1709–1715 (2013)CrossRefGoogle Scholar
  10. 10.
    Juels, A., Kaliski,Jr., Burton S.: PORs: proofs of retrievability for large files. In: 14th ACM Conference on Computer and Communications Security, pp. 584–597, ACM Press, New York (2007)Google Scholar
  11. 11.
    Sebe, F., Domingo-Ferrer, J., Martinez-Balleste, A., Deswarte, Y., Quisquater, J.: Efficient remote data possession checking in critical information infrastructures. J. IEEE Trans Knowl. Data Eng. 20, 1034–1038 (2008)CrossRefGoogle Scholar
  12. 12.
    Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: 14th ACM Conference on Computer and Communications Security. pp. 598–609, ACM Press, New York (2007)
  13. 13.
    Xiao, D., Shu, J., Chen, K., Zheng, W.: A practical data possession checking scheme for networked archival storage. J. Comput. Res. Dev. 46, 1660–1668 (2009)Google Scholar
  14. 14.
    Curtmola, R., Khan, O., Burns, R., Ateniese, G.: MR-PDP: Multiple-Replica Provable Data Possession. In: 28th International Conference on Distributed Computing Systems, pp. 411–420, Beijing (2008)Google Scholar
  15. 15.
    Erway, C., Kupccu, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: 16th ACM Conference on Computer and Communications Security, pp. 213–222, ACM Press, New York (2009)Google Scholar
  16. 16.
    Shacham H., Waters, B.: Compact proofs of retrievability. In: 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, pp. 90–107, Springer-Verlag (2008)Google Scholar
  17. 17.
    Weatherspoon, H., Kubiatowicz, J.:Erasure coding vs. replication: a quantitative comparison. In: 1st International Workshop on Peer-to-Peer Systems, pp. 328–338, Springer-Verlag (2002)
  18. 18.
    Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory. J. 56(9), 4539–4551 (2008)CrossRefGoogle Scholar
  19. 19.
    Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17, 297–319 (2004)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Boneh, D., Gentry, C., Lynn, B., Shacham H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Advances in Cryptology—EUROCRYPT 2003, pp. 416–32, Springer-Verlag (2003)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.SSN College of EngineeringChennaiIndia
  2. 2.College of EngineeringAnna UniversityChennaiIndia

Personalised recommendations