AVOIDING REPLICA ACTIVE DATA STORAGE FOR MULTIPLE USER SITUATION

M. Githanjali, A.V.H Sai Prasad

Abstract


As vs. already stated authenticated formations, e.g. skip list and Merkle tree, we devise a unparalleled authenticated edifice common as Holomorphic Authenticated Tree, We current increased report nearby PoS and lively PoS. Whenever a verifier want to detect the soundness of the file, it madly selects some thwart indexes from the file, and transmits the particular to the perplex waitress. To the marvelous of our perceptive, no alive productive PoSs supports this structure. We refined a unique tool accepted as HAT and that is a superb authenticated organization. We implied the attractive needs in multi-user perplex repository techniques and familiar with the type of deduplicatable lively PoS. Existing lively PoSs can't be continued about the multi-user place. Because of the issue of edifice distinction and tag time, actual organization can't be expanded to progressive PoS. An running multi-user perplex cache arrangement needs the reliable client-side mix-user deduplication mode, that enables everybody to skip the uploading operation and amass the province from the files rapidly, when new proprietors of the interchangeable files have submitted the particular to the distort waitress. To narrow the link cost both in the information of cache aspect and also the deduplication stage note the same computing cost. We demonstrate the invulnerability in our structure, and also the imaginative reasoning and preliminary results disclose that our system is valuable used. Within this study, we unveil the idea of deduplicatable productive signify of stockpile and ask a skilled plan common as DeyPoS, to realize productive PoS and insure mix-user deduplication, concurrently.


Keywords


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

References


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.

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.

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.

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.

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.

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.

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

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, 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.