Dynamic PoS is valuable cryptographic crude that empowers a user to check the trustworthiness of outsourced documents and to proficiently refresh the records in a cloud server. In spite of the fact that analysts have arranged a few dynamic PoS plots in single user situations, the issue in multi-user conditions has not been examined adequately. A sensible multi-user cloud stockpiling framework needs the safe client-side cross-user de-duplication strategy that allows a user to skirt the transferring technique and get the possession of the records now, once elective house proprietors of proportional documents have uploaded them to the cloud server. To the most straightforward of our information, none of the present dynamic PoS will bolster this framework. amid this paper, we tend to present the origination of de-duplicatable dynamic evidence of capacity related propose a development refers to as DeyPoS, to acknowledge dynamic PoS and secure cross-user duplication, in the meantime. Considering the difficulties of structure decent variety and individual tag age, we tend to abuse a one of a kind apparatus alluded to as Homomorphic Authenticated Tree (HAT).

De-duplication, Proof of ownership, Dynamic proof of storage, Cloud Computing

[1] Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” in Proc. of CCS, pp. 598–609, 2007.
[2] A. Juels and B. S. Kaliski, Jr., “PORs: Proofs of retrievability for large files,” in Proc. of CCS, pp. 584 –597,2007.
[3] F. Armknecht, J.-M. Bohli, G. O. Karame, Z. Liu, and C. A. Reuter, “Outsourced proofs of retrievability,” in Proc. of CCS, pp. 831–843, 2014.
[4] H. Shacham and B. Waters, “Compact proofs of retrievability,” in Proc. of ASIACRYPT, pp. 90–107, 2008.
[5] Y. Dodis, S. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in Proc. of TCC, pp. 109–127, 2009.
[6] Z. Mo, Y. Zhou, and S. Chen, “A dynamic proof of retrievability (PoR) scheme with o(logn) complexity,” in Proc. of ICC, pp. 912–916, 2012.
[7] E. Shi, E. Stefanov, and C. Papamanthou, “Practical dynamic proofs of retrievability,” in Proc. of CCS, pp. 325–336, 2013.
[8] D. Cash, A. K¨upc¸ ¨u, and D. Wichs, “Dynamic proofs of retrievability via oblivious RAM,” in Proc. Of EUROCRYPT, pp. 279–295, 2013.
[9] S. Halevi, D. Harnik, B. Pinkas, and A. Shulman-Peleg, “Proofs of ownership in remote storage systems,” in Proc. of CCS, pp. 491–500, 2011.
[10] J. Xu, E.-C. Chang, and J. Zhou, “Weak leakage-resilient client side De-duplication of encrypted data in cloud storage,” in Proc. Of ASIACCS, pp. 195–206, 2013.
[11] Q. Zheng and S. Xu, “Secure and efficient proof of storage with De-duplication,” in Proc. of CODASPY, pp. 1– 12, 2012.
[12] R. Du, L. Deng, J. Chen, K. He, and M. Zheng, “Proofs of ownership and retrievability in cloud storage,” in Proc. of TrustCom, pp. 328–335, 2014.
[13] B. Wang, B. Li, and H. Li, “Public auditing for shared data with efficient user revocation in the cloud,” in Proc. of INFOCOM, pp. 2904–2912, 2013.
[14] B. Wang, B. Li, and H. Li, “Oruta: privacy-preserving public auditing for shared data in the cloud,” IEEE Transactions on Cloud Computing, vol. 2, no. 1, pp. 43–56, 2014.
[15] J. Yuan and S. Yu, “Efficient public integrity checking for cloud data sharing with multi-user modification,” in Proc. of INFOCOM, pp. 2121–2129, 2014.