P. Madhavi, Dr. B. Vijayakumar


As against the current authenticated houses, as an example escape directory and Merkle wood, we produce an unusual authenticated format referred to as Homomorphic Authenticated Tree, we now additional info almost Pops and changing Poss. Whenever a verifier desires to figure out the soundness of one's burnish, it instinctively selects some square indexes with the smooth, and transmits the above-mentioned to the puff minion. To the best of our figuring out, no real go-ahead Poss. supports this system. We refined a contemporary device referred to as HAT that is a superb authenticated network. We prompted the great needs in multi-user distort entrepot procedures and received the kind of DE duplicatable vigorous Poss. Existing lively PoSs cannot be elongated against the multi-user feeling. Because of one's complication of network multiplicity and tag rank, alive artifice cannot be enlarged to energizing Poss. A fulfilling multi-user dim storehouse theory needs the win client-side mix-user deduplication address, which enables an individual to skim the uploading deal with and obtain the paraphernalia of the catalogues instantly, while remaining proprietors of your ditto scrapes include submitted the particular to the puff hostess. to shrink the communique, require the two within the reveal of trading post point and likewise the deduplication development note the dupe figuring damage. We end up the security in our system, and likewise the codified reasoning and momentary results disclose this our raising is active pre-owned. Within the indicated journal, we found the belief of DE duplicatable activating reveal of arsenal and request an all-around apprehension referred to as Dipus, to effect vigorous Pops and confident mix-user deduplication, concurrently.


Homomorphic Authenticated Tree (HAT); Cloud Storage; Dynamic Proof Of Storage; Deduplication;


A. Yun, J. H. Cheon, and Y. Kim, “On Homomorphic Signatures for Network Coding,” IEEE Transactions on Computers, vol. 59, no. 9, pp. 1295–1296, 2010.

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.

Kun He, Jing Chen, Ruiying Du, Qianhong Wu, GuoliangXue, and Xiang Zhang, “DeyPoS: Deduplicatable Dynamic Proof ofStorage for Multi-User Environments”, IEEE Transactions on Computers, 2016.

Z. Ren, L. Wang, Q. Wang, and M. Xu, “Dynamic Proofs of Retrievability for Coded Cloud Storage Systems,” IEEE Transactions on Services Computing, vol. PP, no. 99, pp. 1–1, 2015.

K. D. Bowers, A. Juels, and A. Oprea, “HAIL: A high-availability and integrity layer for cloud storage,” in Proc. of CCS, pp. 187–198, 2009.

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.

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.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.