logo

SCIENCE CHINA Information Sciences, Volume 61, Issue 11: 119101(2018) https://doi.org/10.1007/s11432-017-9286-y

Efficient method to verify the integrity of data with supporting dynamic data in cloud computing

More info
  • ReceivedSep 14, 2017
  • AcceptedOct 27, 2017
  • PublishedAug 15, 2018

Abstract

There is no abstract available for this article.


Acknowledgment

This work was supported by National Natural Science Foundation of China (Grant Nos. 61501080, 61572095, 61771090).


Supplement

Appendix A.


References

[1] Zhang Y, Xu C, Liang X. Efficient public verification of data integrity for cloud storage systems from indistinguishability obfuscation. IEEE TransInformForensic Secur, 2017, 12: 676-688 CrossRef Google Scholar

[2] Sookhak M, Gani A, Khan M K. WITHDRAWN: dynamic remote data auditing for securing big data storage in cloud computing. Inf Sci, 2017, 380: 101-116 CrossRef Google Scholar

[3] Garg N, Bawa S. RITS-MHT: relative indexed and time stamped Merkle hash tree based data auditing protocol for cloud computing. J Network Comput Appl, 2017, 84: 1-13 CrossRef Google Scholar

[4] Bonomi F, Mitzenmacher M, Panigrahy R, et al. An improved construction for counting bloom filters. In: Proceedings of the 14th Annual European Symposium on Algorithms, Zurich, 2006. 684--695. Google Scholar

[5] Wang Q, Wang C, Ren K. Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans Parallel Distrib Syst, 2011, 22: 847-859 CrossRef Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1