| Autor: |
Kumar, K. Kishore, Balaram, A., Ravi, M., Rao, H. V. Ramana |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2023, Vol. 2548 Issue 1, p1-6, 6p |
| Abstrakt: |
In modern era data storage outsourcing as well as resource sharing amongst the network services plays a vital role. But the next thing into the focus would be preserving the virtue of the data shared at different servers or different locations that can be un-trusted or trusted. Attention should be paid for such situations. In PDP model pre-processing of the client data is done initially and then it is forwarded to the un-trusted storage that can be a server or anything, keeping with us a little amount of the metadata is preserved. Further at any moment a client may request a service machine to prove the hoarded data has not been meddled or modified or removed. The flaw with the PDP is it can be applicable only to the static files. We try to enhance this PDP algorithm by developing a frame work which is applicable to the dynamic data. Extra features of the substantiated libraries depending upon grading data can be used. The levy of the runtime modifications can be a varied from best case O (1) performance. If a particular file has k-chunks, there is a probability of detecting the misbehavior of a user. One result shows low cost for the experiment of a file consisting of 1GB size, we try to apply our proposed scheme to version control system and outsourced file system. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
