Citation: | QI Yining, TANG Xin, HUANG Yongfeng, “Enabling Efficient Batch Updating Verification for Multi-versioned Data in Cloud Storage,” Chinese Journal of Electronics, vol. 28, no. 2, pp. 377-385, 2019, doi: 10.1049/cje.2018.02.007 |
G. Ateniese, R. Burns, R. Curtmola, et al., “Provable data possession at untrusted stores”, Proc. of the 14th ACM Conference on Computer and Communications Security (CCS’ 07), Alexandria, Virginia, USA, pp.598-609, 2007.
|
Q. Wang, C. Wang, K. Ren, et al., “Enablingpublic auditability and data dynamics for storage security in cloud computing”, IEEE Transactions on Parallel and Distributed Systems, Vol.22, No.5, pp.847-859, 2011.
|
Z. Mo, Y. Zhou, S. Chen, et al., “A dynamic proof of retrievability (POR) scheme with O(log n) complexity”, Proc. of the IEEE International Conference on Communications (ICC’ 12), Ottawa, Ontario, Canada, pp.912-916, 2012.
|
Z. Mo, Q. Xiao, Y. Zhou, et al., “On deletion of outsourced data in cloud computing”, Proc. of the 7th IEEE International Conference on Cloud Computing (IEEE CLOUD’ 14), Alaska, USA, pp.344-351, 2014.
|
M. Naor and G.N. Rothblum, “The complexity of online memory checking”, Journal of the ACM, Vol.56, No.1, pp.2, 2009.
|
A. Oprea, M.K. Reiter, Ke Yang, et al., “Space-efficient block storage integrity”, Proc. of the Network and Distributed System Security Symposium (NDSS’ 2005), San Diego, California, USA, 2005.
|
A. Juels and B.S. KaliskiJr, “Pors: Proofs of retrievability for large files”, Proc. of the 14th ACM Conference on Computer and Communications Security (CCS’ 07), Alexandria, Virginia, USA, pp.584-597, 2007.
|
H. Shacham and B. Waters, “Compact proofs of retrievability”, Journal of Cryptology, Vol.26, No.3, pp.442-483, 2013.
|
K.D. Bowers, A. Juels, A. Oprea, et al., “Proofs of retrievability: Theory and implementation”, Proc. of the 2009 ACM Workshop on Cloud Computing Security, Chicago, Illinois, USA, pp.43-54, 2009.
|
E.C. Chang and J. Xu, “Remote integrity check with dishonest storage server”, Proc. of European Symposium on Research in Computer Security (ESORICS 2008), Málaga, Spain, pp.223-237, 2008.
|
M.A. Shah, R. Swaminathan, M. Baker, et al., “Privacypreserving audit and extraction of digital contents”, Cryptologye Print Archive, Vol.2008, pp.186, 2008.
|
C. Wang, Q. Wang, K. Ren, et al., “Privacy-preserving public auditing for data storage security in cloud computing”, Proc. of International Conference on Computer Communications (INFOCOM 2010), San Diego, California, USA, pp.1-9, 2010.
|
C.C. Erway, A. Kupcu, C. Papamanthou, et al., “Dynamic provable data possession”, ACM Transactions on Information and System Security, Vol.17, No.4, pp.15, 2015.
|
C. Liu, R. Ranjan, C. Yang, et al., “Mur-dpa: Top-down levelled multi-replica merkle hash tree based secure public auditing for dynamic big data storage on cloud”, IEEE Transactions on Computers, Vol.64, No.9, pp.2609-2622, 2015.
|
X. Tang, Y. Qi, Y. Huang, et al., “Reputation audit in multi-cloud storage through integrity verification and data dynamics”, Proc. of the 9th International Conference on Cloud Computing (IEEE CLOUD’ 16), San Francisco, California, USA, pp.624-631, 2016.
|
Z. Mo, Y. Zhou, S. Chen, et al., “Enabling non-repudiable data possession verification in cloud storage systems”, Proc. of the 7th IEEE International Conference on Cloud Computing (IEEE CLOUD’ 14), Alaska, USA, pp.232-239, 2014.
|
C.C. Foster, “A generalization of avltrees”, Communications of the ACM, Vol.16, No.8, pp.513-517, 1973.
|