Guaranteed De-Duplication Using Hybrid Cloud
Keywords:
Deduplication, Hybrid cloud, Authorized duplicate check schemeAbstract
Data de-duplication is one altogether necessary data compression techniques for eliminating duplicate copies of continuation data, and has been wide utilized in cloud storage to cut back the amount of house for storing and save metric. In Existing System, we've associate inclination to gift a phrase search technique supported Bloom filters that is significantly faster than existing solutions, with similar or higher storage and communication value. Our technique uses a series of n-gram filters to support the standard. The theme exhibits a trade-off between storage and false positive rate, and is adjustable to defend against inclusion-relation attacks. the strategy approach supported award application’s target false positive rate is besides delineate. to higher defend information security, this paper makes the primary arrange to formally address the matter of approved data deduplication. Whole entirely whole entirely whole entirely whole entirely entirely whole entirely fully totally different from ancient deduplication systems, the differential privileges of users ar any thought of in duplicate check besides the data itself. we've an inclination to besides present several new deduplication constructions supporting approved duplicate register a hybrid cloud vogue. Security analysis demonstrates that our theme is secure in terms of the definitions per the planned security model.As a whole of construct, we've a bent to tend to implement a image of our projected approved duplicate check theme and conduct tested experiments victimization our image. we've a bent to tend to purpose that our planned approved duplicate check theme incurs smallest overhead compared to ancient operations.
References
- M. Bellare, C. Namprempre, and G. Neven. Security proofs for identity-based identification and signature schemes. http://www.cse.ucsd.edu/users/mihir/crypto-research-papers.html, February 2004.
- M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The one-more-RSA-inversion problems and the security of Chaum’s blind signature scheme. J. Cryptology, 16(3):185–215, June 2003.
- M. Bellare and A. Palacio. GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attack. In M. Yung, editor, CRYPTO 2002, volume 2442 of LNCS, pages 162–177. Springer-Verlag, August 2002.
- K.G. Paterson. ID-based signatures from pairings on elliptic curves. Technical Report 2002/004, IACR ePrint Archive, January 2002.
- D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. J. Cryptology, 13(3):361–396, 2000.
- S. Saeednia and R. Safavi-Naini. On the security of girault’s identification scheme. In H. Imai and Y. Zheng, editors, PKC 1998, volume 1431 of LNCS, pages 149–153. Springer-Verlag, February 1998.
- R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. In SCIS 2000, Okinawa, Japan, January 2000.
- J. Stern, D. Pointcheval, J. Malone-Lee, and N.P. Smart. Flaws in applying proof methodologies to signature schemes. In M. Yung, editor, CRYPTO 2002, volume 2442 of LNCS, pages 93–110. Springer-Verlag, August 2002.
- X. Yi. An identity-based signature scheme from the weil pairing. IEEE Communications Letters, 7(2):76–78, 2003.
- Shamir, A., 1979. How to Share a Secret, Commun.
- Clements, A.T., I. Ahmad, M. Vilayannur, and J. Li, ACM, 22(11): 612-613. 2009. Decentralized De duplication in San Cluster File 12Gnanamurthy, R.K., L. Malathi and M.K. Systems, in Proc.USENIX ATC, pp: Chandrasekaran, 2015. Energy efficient data collection through hybrid unequal clustering for wireless sensor networks, Computers & Electrical Engineering, 48: 358-370.
- F. Guo and P. Efstathopoulos. Building a high performance deduplication system. In Proc. USENIX ATC, Jun 2011.
- K. Jin and E.L. Miller. The effectiveness of deduplication on virtual machine disk images. In Proc. SYSTOR, May 2009.
- M. Kaczmarczyk, M. Barczynski, W. Kilian, and C. Dubnicki. Reducing impact of data fragmentation caused by in-line deduplication. In Proc. SYSTOR, Jun 2012.
- E. Kruus, C. Ungureanu, and C. Dubnicki. Bimodal content defined chunking for backup streams. In Proc. USENIX FAST, Feb 2010.
- S. Quinlan and S. Dorward. Venti: a new approach to archival storage. In Proc. USENIX FAST, Jan 2002.
- S. Rhea, R. Cox, and A. Pesterev. Fast, inexpensive contentaddressed storage in foundation. In Proc. USENIX ATC, Jun 2008.
- K. Srinivasan, T. Bisson, G. Goodson, and K. Voruganti. iDedup: Latency-aware, inline data deduplication for primary storage. In Proc. USENIX FAST, Feb 2012.
- B. Zhu, K. Li, and H. Patterson. Avoiding the disk bottleneck in the data domain deduplication file system. In Proc. USENIX FAST, Feb 2008.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.