Call for Paper - February 2021 Edition
IJCA solicits original research papers for the February 2021 Edition. Last date of manuscript submission is January 20, 2021. Read More

Deduplication of Dynamic Proof of Storage for Multi-User Environments

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2018
Rahul Hulsure, Amol Datal, Ambulge S. S.

Rahul Hulsure, Amol Datal and Ambulge S S.. Deduplication of Dynamic Proof of Storage for Multi-User Environments. International Journal of Computer Applications 179(38):42-44, April 2018. BibTeX

	author = {Rahul Hulsure and Amol Datal and Ambulge S. S.},
	title = {Deduplication of Dynamic Proof of Storage for Multi-User Environments},
	journal = {International Journal of Computer Applications},
	issue_date = {April 2018},
	volume = {179},
	number = {38},
	month = {Apr},
	year = {2018},
	issn = {0975-8887},
	pages = {42-44},
	numpages = {3},
	url = {},
	doi = {10.5120/ijca2018916894},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


Now a days Dynamic Proof of Storage (DeyPoS) could be a helpful crypto graphical primitive that permits a user to survey the integrity of outsourced files and to with efficiency update the files during a cloud server. Though researchers have planned several DeyPoS schemes in single user environments, the matter in multi-user environments has not been investigated sufficiently. A sensible multi-user cloud storage system requirement the secure client-side cross-user deduplication technique, that permits a user to skip the uploading method and obtain the possession of the files now, once different house owners of identical files have uploaded them to the cloud server. To the best of our data, none of the fundamental DeyPoS will support this system. during this paper, we tend to introduce the construct of deduplicatable dynamic proof of storage Associate in Nursing d propose an economical creation referred to as DeyPoS, to realize dynamic DeyPoS and secure cross-user deduplication, at the same time. Considering the challenges of structure diversity and personal tag generation, we tend to exploit a novel tool referred to as Homo morphic documented Tree (HAT). We tend to prove the protection of our construction, and therefore the theoretical analysis and experimental results show that our construction is economical in observe.


  1. S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc. of FC, pp. 136–149, 2010.
  2. Z. Xia, X. Wang, X. Sun, and Q. Wang, “A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data,” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 2, pp. 340–352, 2016.
  3. Z. Xiao and Y. Xiao, “Security and privacy in cloud computing,” IEEE Communications Surveys Tutorials, vol. 15, no. 2, pp. 843–859, 2013.
  4. C. A. Ardagna, R. Asal, E. Damiani, and Q. H. Vu, “From Security to Assurance in the Cloud: A Survey,” ACM Comput. Surv., vol. 48, no. 1, pp. 2:1–2:50, 2015.
  5. G. 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.
  6. G. Ateniese, R. Di Pietro, L. V. Mancini, and G. Tsudik, “Scalable and Efficient Provable Data Possession,” in Proc. of SecureComm, pp. 1–10, 2008.
  7. G. Ateniese, S. Kamara, and J. Katz, “Proofs of storage from homomorphic identification protocols,” in Proc. of ASIACRYPT, pp. 319–333, 2009.
  8. C. Erway, A. K¨upc ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in Proc. of CCS, pp. 213–222, 2009.
  9. R. Tamassia, “Authenticated Data Structures,” in Proc. of ESA, pp. 2–5, 2003.
  10. Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in Proc. of ESORICS, pp. 355–370, 2009.


Deduplication, Cloud Storage, encryption, Proof of Ownership, Revocation