DPoSt: Dynamic Proof of Storage-time
Proof of storage-time (PoSt) enforces highly reliable data storage services to data owners by providing lightweight and continuous data availability or possession checks to the uploaded data. Despite being promising, current PoSt schemes mainly focus on static data that will not change after a PoSt process starts. This limitation, however, would largely undermine the practicality of PoSt schemes as they cannot be effectively used for important and emerging cloud storage services like document sharing, code collaboration, and website management that will modify the uploaded data whenever needed. In this paper, we propose DPoSt, a new PoSt system that provides continuous auditing protection to data owners while supporting efficient data updates. DPoSt is built with a tailored suite of cryptographic primitives to update the intermediate auditing proofs while reducing the changes we need to conduct for subsequent challenge and proof pairs in the PoSt process. We develop a prototype of DPoSt, and the evaluation results demonstrate the efficiency of DPoSt for supporting dynamic PoSt operations.
Authors
- Xiaohua Jia (ORCID: https://orcid.org/0000-0001-8702-8302)
- Chengjun Cai (ORCID: https://orcid.org/0000-0002-8045-4226)
- Zhi-An Huang (ORCID: https://orcid.org/0000-0001-9974-148X)
- Qingyuan Xie (ORCID: https://orcid.org/0000-0001-6799-1417)
- Mingyue Wang (ORCID: https://orcid.org/0000-0002-2649-1819)
Institutions
- City University of Hong Kong (HK)
- City College of Dongguan University of Technology (CN)
Publication Details
- Published
- 2024-12-20
- DOI
- https://doi.org/10.1109/msn63567.2024.00108
- Primary Topic
- Parallel Computing and Optimization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00