Dynamic proof of storage in multiple user Envirmment

Abstract

Dynamic Proof of Storage (Po S) could be a helpful cryptographic primitive that permits a user to envision the
integrity of outsourced _les and to with efficiency update the files in an exceedingly cloud server. though researchers
have projected several dynamic Po S schemes in single user environments, the matter in multi-user environments has not
been investigated sufficiently sensible multi-user cloud storage system wants the secure client-side cross-user
reduplication technique, that permits a user to skip the uploading method and acquire the possession of the files at once,
once alternative homeowners of identical files have uploaded them to the cloud server. To the most effective of our
knowledge, none of the prevailing dynamic PoSs will support this technique. during this paper, we tend to introduce the
conception of reduplicatable dynamic proof of storage associated propose an economical construction referred to as Dey
Po S, to realize dynamic Po S and secure cross-user reduplication, at the same time. Considering the challenges of
structure diversity and private tag generation, we tend to exploit a completely unique tool referred to as Homomorphism
Authenticated Tree (HAT). We tend to prove the safety of our construction, and therefore the theoretical analysis and
experimental results show that our construction is economical in observe.