Skip to main content
SpringerLink
Log in

A method for achieving provable data integrity in cloud computing

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

By storing data files in the cloud, users can make use of cloud computing techniques, thereby reducing hardware investment and simplifying data management. However, ensuring data integrity when using unreliable service providers is a problem. In this paper, we propose a novel method for provable data integrity (PDI) aimed at clients with data stored in untrusted servers in cloud computing environments. An advantage of this model is the low client cost since a constant amount of metadata is generated. Based on a bilinear group, we propose a simple, efficient audit service for public verification of untrusted outsourced storage. Compared with existing PDI methods, we aim to resolve this issue by considering the cost of generating verification metadata at the client. Furthermore, our method supports data dynamics and public verifiability. Finally, the results of extensive experiments conducted to evaluate the performance of our method demonstrate that our method achieves high efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Ateniese G, Burns R, Curtmola R, Herring J, Khan O, Kissner L, Peterson Z, Song D (2011) Remote data checking using provable data possession. ACM Trans Inf Syst Secur (TISSEC) 14(1):12

    Article  Google Scholar 

  2. Ateniese G, Burns R, Curtmola R, Herring J, Kissner L, Peterson Z, Song D (2007) Provable data possession at untrusted stores. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, New York, pp 598–609

  3. Boneh D, Lynn B, Shacham H (2001) Short signatures from the weil pairing. In: Advances in cryptology—ASIACRYPT’01. Springer, New York, pp 514–532

  4. Boneh D, Lynn B, Shacham H (2004) Short signatures from the weil pairing. J Cryptol 17(4):297–319

    Article  MathSciNet  MATH  Google Scholar 

  5. Dodis Y, Vadhan S, Wichs D (2009) Proofs of retrievability via hardness amplification. In: Theory of cryptography. Springer, New York, pp 109–127

  6. Erway C, Küpçü A, Papamanthou C, Tamassia R (2009) Dynamic provable data possession. In: Proceedings of the 16th ACM conference on computer and communications security (CCS’09). ACM, New York, pp 213–222. doi:10.1145/1653662.1653688

  7. Grobauer B, Walloschek T, Stöcker E (2011) Understanding cloud computing vulnerabilities. Secur Priv IEEE 9(2):50–57

    Article  Google Scholar 

  8. Juels A, Kaliski BS Jr (2007) Pors: proofs of retrievability for large files. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, New York, pp 584–597

  9. Mell P, Grance T (2009) The NIST definition of cloud computing. Natl Inst Stand Technol 53(6):50

    Google Scholar 

  10. Shacham H, Waters B (2008) Compact proofs of retrievability. In: Advances in cryptology—ASIACRYPT’08. Springer, New York, pp 90–107

  11. Shacham H, Waters B (2013) Compact proofs of retrievability. J Cryptol 26(3):442–483

    Article  MathSciNet  MATH  Google Scholar 

  12. Shuang T, Lin T, Xiaoling L, Yan J (2014) An efficient method for checking the integrity of data in the cloud. Commun China 11(9):68–81

    Article  Google Scholar 

  13. Wang C, Wang Q, Ren K, Lou W (2010) Privacy-preserving public auditing for data storage security in cloud computing. In: INFOCOM, 2010 proceedings IEEE. IEEE, pp 1–9

  14. Wang Q, Wang C, Li J, Ren K, Lou W (2009) Enabling public verifiability and data dynamics for storage security in cloud computing. In: Computer security—ESORICS’09. Springer, New York, pp 355–370

  15. Wang Q, Wang C, Ren K, Lou W, Li J (2011) Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans Parallel Distrib Syst 22(5):847–859

    Article  Google Scholar 

  16. Zhu Y, Hu H, Ahn GJ, Yu M (2012) Cooperative provable data possession for integrity verification in multicloud storage. IEEE Trans Parallel Distrib Syst 23(12):2231–2244

    Article  Google Scholar 

  17. Zhu Y, Wang H, Hu Z, Ahn GJ, Hu H (2011) Zero-knowledge proofs of retrievability. Sci China Inf Sci 54(8):1608–1617

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 61472433) and the National Basic Research Program of China (973 Program, No. 2013CB329604).

Author information

Authors and Affiliations

  1. Computer School, National University of Defense Technology, Changsha, 410073, China

    Aiping Li, Shuang Tan & Yan Jia

Authors
  1. Aiping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuang Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aiping Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, A., Tan, S. & Jia, Y. A method for achieving provable data integrity in cloud computing. J Supercomput 75, 92–108 (2019). https://doi.org/10.1007/s11227-015-1598-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-015-1598-2

Keywords

Search

Navigation