Department of Computer Engineering2024-11-092015978-3-319-19848-4978-3-319-19847-70302-974310.1007/978-3-319-19848-4_52-s2.0-84947928864http://dx.doi.org/10.1007/978-3-319-19848-4_5https://hdl.handle.net/20.500.14288/10485Security measures, such as proving data integrity, became more important with the increase in popularity of cloud data storage services. Dynamic Provable Data Possession (DPDP) was proposed in the literature to enable the cloud server to prove to the client that her data is kept intact, even in a dynamic setting where the client may update her files. Realizing that variable-sized updates are very inefficient in DPDP (in the worst case leading to uploading the whole file again), Flexible DPDP (FlexDPDP) was proposed. In this paper, we analyze FlexDPDP scheme and propose optimized algorithms. We show that the initial pre-processing phase at the client and server sides during the file upload (generally the most time-consuming operation) can be efficiently performed by parallelization techniques that result in a speed up of 6 with 8 cores. We propose a way of handling multiple updates at once both at the server and the client side, achieving an efficiency gain of 60% at the server side and 90% in terms of the client's update verification time. We deployed the optimized FlexDPDP on the large-scale network testbed PlanetLab and demonstrate the efficiency of our proposed optimizations on multi-client scenarios according to real workloads based on version control system traces.Computer scienceInformation systemsEngineeringSoftware engineeringTheory methodsConference proceeding1611-3349364322800005Q42948