Skip to main content
SpringerLink
Log in

Towards comprehensive provable data possession in cloud computing

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

To check the remote data integrity in cloud computing, we have proposed an efficient and full data dynamic provable data possession (PDP) scheme that uses a SN (serial number)-BN (block number) table to support data block update. In this article, we first analyze and test its performance in detail. The result shows that our scheme is efficient with low computation, storage, and communication costs. Then, we discuss how to extend the dynamic scheme to support other features, including public auditability, privacy preservation, fairness, and multiple-replica checking. After being extended, a comprehensive PDP scheme that has high efficiency and satisfies all main requirements is provided.

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

Similar content being viewed by others

References

  1. Deswarte Y, Quisquater J J, Saidane A. Remote integrity checking [C]//Proceedings of IICIS’03. Berlin: Springer-Verlag, 2003: 1–11.

    Google Scholar 

  2. Ateniese G, Burns R, Curtmola R, et al. Provable data possession at untrusted stores [C]//Proceedings of ACM-CCS’07. New York: ACM Press, 2007: 598–609.

    Google Scholar 

  3. Juels A, Kaliski B S. Pors: Proofs of retrievability for large files [C]//Proceedings of ACM-CCS’07. New York: ACM Press, 2007: 584–597.

    Google Scholar 

  4. Ateniese G, Di Pietro R, Mancini L V, et al. Scalable and efficient provable data possession [C]//Proceedings of Secure Comm’08. New York: ACM Press, 2008: 1–10.

    Google Scholar 

  5. Wang Qian, Wang Cong, Ren Kui, et al. Enabling public auditability and data dynamics for storage security in cloud computing [J]. IEEE Transaction on Parallel and Distributed Systems, 2011, 22(5): 847–859.

    Article  Google Scholar 

  6. Hao Zhuo, Zhong Sheng, Yu Nenghai. A privacy-preserving remote data integrity checking protocol with data dynamics and public verifiability [J]. IEEE Transaction on Knowledge and Data Engineering, 2011, 23(9): 1432–1437.

    Article  Google Scholar 

  7. Luo Wenjun, Bai Guojing. Ensuring the data integrity in cloud data storage [C]//Proceedings of CCIS’11. Buffalo: IEEE Computer Society, 2011: 240–243.

    Google Scholar 

  8. Wang Cong, Wang Qian, Ren Kui, et al. Privacy-preserving public auditing for data storage security in cloud computing [C]//Proceedings of IEEE INFOCOM’10. Buffalo: IEEE Computer Society, 2010: 1–9.

    Google Scholar 

  9. Hao Zhuo, Yu Nenghai. A multiple-replica remote data possession checking protocol with public verifiability [C]// Proceedings of ISDPE’10. Buffalo: IEEE Computer Society, 2010: 84–89.

    Google Scholar 

  10. Zhu Yan, Wang Huaixi, Hu Zexing, et al. Dynamic audit services for integrity verification of outsourced storage in clouds [C]//Proceedings of SAC’11. New York: ACM Press, 2011: 1550–1557.

    Google Scholar 

  11. Zheng Qingji, Xu Shouhuai. Fair and dynamic proofs of retrievability [C]//Proceedings of CODASPY’11. New York: ACM Press, 2011: 237–248.

    Google Scholar 

  12. Liu Feifei, Gu Dawu, Lu Haining. An improved dynamic provable data possession model [C]//Proceedings of CCIS’11. Buffalo: IEEE Computer Society, 2011: 290–295.

    Google Scholar 

  13. Curtmola R, Khan O, Burns R, et al. MR-PDP: Multiple-replica provable data possession [C]//Proceedings of IEEE ICDCS’08. Buffalo: IEEE Computer Society, 2008: 411–420.

    Google Scholar 

  14. Barsoum A F, Anwar H M. Provable possession and Replication of data over cloud servers [EB/OL]. [2011-06-12]. http://www.cacr.math.uwaterloo.ca/techreport/2010/cacr2010-32.pdf.

  15. Sebe F, Domingo-Ferrer J, Martinez-Balleste A, et al. Efficient remote data possession checking in critical information infrastructures [J]. IEEE Transaction on Knowledge and Data Engineering, 2008, 22(5): 1034–1038.

    Article  Google Scholar 

  16. Li Chaoling, Chen Yue, Tan Pengxu, et al. An efficient provable data possession scheme with data dynamics [C]// Proceedings of CSSS’12. Buffalo: IEEE Computer Society, 2012: 706–710.

    Google Scholar 

  17. Bellare M, Guérin R, Rogaway P. XOR MACs: New methods for message authentication using finite pseudorandom functions [C]//Proceedings of CRYPTO’95. Berlin: Springer-Verlag, 1995: 15–28.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Cyberspace Security, PLA Information Engineering University, Zhengzhou, 450004, Henan, China

    Chaoling Li, Yue Chen, Pengxu Tan & Gang Yang

Authors
  1. Chaoling Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yue Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pengxu Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yue Chen.

Additional information

Foundation item: Supported by the National Basic “863” Research Program of China (2012CB315901)

Biography: LI Chaoling, male, Ph.D. candidate, research direction: trusted computing and cloud computing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, C., Chen, Y., Tan, P. et al. Towards comprehensive provable data possession in cloud computing. Wuhan Univ. J. Nat. Sci. 18, 265–271 (2013). https://doi.org/10.1007/s11859-013-0926-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-013-0926-8

Key words

CLC number

Search

Navigation