An approach to improve the time complexity of dynamic provable data possession
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
In this thesis, we aim to take some actions for alleviating the fears when the data storage over outsourcing, and guarantee the integrity of the files in cloud computing. In this study, we have suggested some ideas to improve FlexDPDP scheme [13]. Particularly, proposed scheme successfully reduces the time complexity for verifying operations between the client and the server. The proposed scheme is a fully dynamic model. We involved some parameters to ensure the integrity of the metadata. In spite of the fact that auxiliary storage expenditure by Client-side (the client stores approximately 0.025% size of the raw file). The remarkable enhancement in this proposed scheme is reducing the complexity. The complexity of the communications and the computations decreased to O(1) in both Client-side and Server-side during the dynamically update (insertion, modification and deletion operations) and challenge operations.
Author
Mohammed Kadhım Hawı
How to Cite
Mohammed Kadhım Hawı (Master Thesis). An approach to improve the time complexity of dynamic provable data possession, 2016, Çankaya University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Çankaya University
- Investigation of amazon and google for fault tolerance strategies in cloud computing services(2015)
- Investigation in MYSQLdatabase and NEO4J database(2015)
- Exchange rate and inflation relationship: The case of Turkey(2023)
- Effects of the economic news on herd behavior(2023)
- Experimental analysis of effects of different network parameters on TCP / IP networks(2025)
- Reconstruction of patriarchy through matriarchy: A critique of gendered power structures in Naomi Alderman's The Power(2025)