1. Dynamic Proof of Data Possession and Replication With Tree Sharing and Batch Verification in the Cloud
- Author
-
Hua Zhang, Wei Guo, Wenmin Li, Fei Gao, Su-Juan Qin, Qiao-Yan Wen, and Zhengping Jin
- Subjects
Information Systems and Management ,Computer Networks and Communications ,business.industry ,Computer science ,Distributed computing ,Cloud computing ,Computer security model ,Replication (computing) ,Computer Science Applications ,Tree (data structure) ,Hardware and Architecture ,Server ,Bandwidth (computing) ,Redundancy (engineering) ,business ,Cloud storage - Abstract
Cloud storage attracts a lot of clients to join the paradise. For a high data availability, some clients require their files to be replicated and stored on multiple servers. Because clients are generally charged based on the redundancy level required by them, it is critical for clients to obtain convincing evidence that all replicas are stored correctly and are updated to the up-to-date version. In this paper, we propose a dynamic proof of data possession and replication (DPDPR) scheme, which is proved to be secure in the defined security model. Our scheme shares a single authenticated tree across multiple replicas, which reduces the tree's storage cost significantly. Our scheme allows for batch verification for multiple challenged leaves and can verify multiple replicas in a single batch way, which considerably save bandwidth and computation resources during audit process. We also evaluate the DPDPR's performance and compare it with the most related scheme. The evaluation results show that our scheme saves almost 66% tree's storage cost for three replicas, and obtains almost 60% and 80% efficiency improvements in terms of the overall bandwidth and computation costs, respectively, when three replicas are checked and each challenged with 460 blocks.
- Published
- 2022
- Full Text
- View/download PDF