Enabling Efficient Verification of Dynamic Data Possession and Batch Updating in Cloud Storage

Dynamic data possession verification is a common requirement in cloud storage systems. After the client outsources its data to the cloud, it needs to not only check the integrity of its data but also verify whether the update is executed correctly. Previous researches have proposed various schemes based on Merkle Hash Tree (MHT) and implemented some initial improvements to prevent the tree imbalance. This paper tries to take one step further: Is there still any problems remained for optimization? In this paper, we study how to raise the efficiency of data dynamics by improving the parts of query and rebalancing, using a new data structure called Rank-Based Merkle AVL Tree (RB-MAT). Furthermore, we fill the gap of verifying multiple update operations at the same time, which is the novel batch updating scheme. The experimental results show that our efficient scheme has better efficiency than those of existing methods.

[1]  Hong Jiang,et al.  Dynamic and Public Auditing with Fair Arbitration for Cloud Data , 2018, IEEE Transactions on Cloud Computing.

[2]  Jin Liu,et al.  Dynamic-Hash-Table Based Public Auditing for Secure Cloud Storage , 2017, IEEE Transactions on Services Computing.

[3]  Yining Qi,et al.  Fragile Watermarking Based Proofs of Retrievability for Archival Cloud Data , 2016, IWDW.

[4]  Abdul Razaque,et al.  Triangular data privacy-preserving model for authenticating all key stakeholders in a cloud environment , 2016, Comput. Secur..

[5]  Yining Qi,et al.  Reputation Audit in Multi-cloud Storage through Integrity Verification and Data Dynamics , 2016, 2016 IEEE 9th International Conference on Cloud Computing (CLOUD).

[6]  Jinjun Chen,et al.  MuR-DPA: Top-Down Levelled Multi-Replica Merkle Hash Tree Based Secure Public Auditing for Dynamic Big Data Storage on Cloud , 2015, IEEE Transactions on Computers.

[7]  Baochun Li,et al.  Cooperative repair with minimum-storage regenerating codes for distributed storage , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[8]  Cheng-Zhong Xu,et al.  Enabling Non-repudiable Data Possession Verification in Cloud Storage Systems , 2014, 2014 IEEE 7th International Conference on Cloud Computing.

[9]  Shigang Chen,et al.  On Deletion of Outsourced Data in Cloud Computing , 2014, 2014 IEEE 7th International Conference on Cloud Computing.

[10]  Rafail Ostrovsky,et al.  Locally Updatable and Locally Decodable Codes , 2014, TCC.

[11]  Xiaohua Jia,et al.  An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing , 2013, IEEE Transactions on Parallel and Distributed Systems.

[12]  David Cash,et al.  Dynamic Proofs of Retrievability Via Oblivious RAM , 2013, Journal of Cryptology.

[13]  Marten van Dijk,et al.  Iris: a scalable cloud file system with efficient integrity checks , 2012, ACSAC '12.

[14]  Sawan Kumar,et al.  Ensuring data storage security in Cloud Computing , 2009, 2009 17th International Workshop on Quality of Service.

[15]  Gail-Joon Ahn,et al.  Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage , 2012, IEEE Transactions on Parallel and Distributed Systems.

[16]  Shigang Chen,et al.  A dynamic Proof of Retrievability (PoR) scheme with O(logn) complexity , 2012, 2012 IEEE International Conference on Communications (ICC).

[17]  Zhenyu Yang,et al.  LT codes-based secure and reliable cloud storage service , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  Cong Wang,et al.  Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing , 2011, IEEE Transactions on Parallel and Distributed Systems.

[19]  Stephen S. Yau,et al.  Dynamic audit services for integrity verification of outsourced storages in clouds , 2011, SAC.

[20]  Ari Juels,et al.  Proofs of retrievability: theory and implementation , 2009, CCSW '09.

[21]  Roberto Tamassia,et al.  Dynamic provable data possession , 2009, IACR Cryptol. ePrint Arch..

[22]  Hovav Shacham,et al.  Compact Proofs of Retrievability , 2008, Journal of Cryptology.

[23]  Jia Xu,et al.  Remote Integrity Check with Dishonest Storage Server , 2008, ESORICS.

[24]  Roberto Di Pietro,et al.  Scalable and efficient provable data possession , 2008, IACR Cryptol. ePrint Arch..

[25]  Ari Juels,et al.  Pors: proofs of retrievability for large files , 2007, CCS '07.

[26]  Reza Curtmola,et al.  Provable data possession at untrusted stores , 2007, CCS '07.

[27]  Moni Naor,et al.  The complexity of online memory checking , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[28]  Caxton C. Foster,et al.  A generalization of AVL trees , 1973, Commun. ACM.

[29]  Michael K. Reiter,et al.  Space-Efficient Block Storage Integrity , 2005, NDSS.