Main Article Content
Secure deduplication is a technique to remove duplicate copies of storage data, and provides security to them. To reduce storage space and upload bandwidth in cloud storage deduplication has been a excellent technique. For that purpose convergent encryption has been extensively adopt for secure deduplication, condemn issue of making convergent encryption practical is to efficiently and reliably manage a huge number of convergent keys. The fundamental idea in this, is that eliminate duplicate copies of storage data and limit the damage of stolen data if decrease the value of that thieved information to the attacker. Here it makes the first attempt to formally address the problem of achieving efficient and reliable key management in secure deduplication. Here, it first introduce a baseline approach in which each user holds an independent master key for encrypting the convergent keys and outsourcing them. Such a baseline key handling scheme generates an enormous number of keys with the expand number of users and requires users to dedicatedly protect the master keys. To this end, here offeredDekey, User Behaviour Proﬁling and Decoys technology. New construction ,Dekeyin which users do not need to manage any keys on their own but instead securely distribute the convergent key shares across multiple servers for insider attacker. As a feasibility studies, implementation ofDekey by using the Ramp secret sharing scheme and demonstrate that Dekey incurs limited overhead in realistic environments. Two technology,User profiling and decoys, then, serve the purposes: First one is validating whether data access is authorized when abnormal information access is detected, and second one is that confusing the attacker with bogus information. The combination of these security features will provide unprecedented excellent levels of security for the deduplication in insider and outsider attacker.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
- M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
- Ayushi “A Symmetric Key Cryptographic Algorithm ”International Journal of Computer Applications (0975 - 8887) ©2010 Volume 1 – No. 15
- Abdul Wahid Soomro, Nizamuddin, ArifIqbal Umar, Noorul Amin.” Secured Symmetric Key Cryptographic Algorithm for Small Amount of Data” 3rd International Conference on Computer & Emerging Technologies (ICCET 2013)
- J.R. Douceur, A. Adya, W.J. Bolosky, D. Simon, and M. Theimer, ‘‘Reclaiming Space from Duplicate Files in a Serverless Distributed File System,’’ in Proc. ICDCS, 2002, pp. 617-624.
- W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer, “Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs”, SIGMETRICS 2000, ACM, 2000, pp.34-43.
- A. Adya, W. J. Bolosky, M. Castro, R. Chaiken, G. Cermak, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. Wattenhofer. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, Dec.2002.USENIX.
- R. Anderson and E. Biham, “Two Practical and Provably Secure Block Ciphers: BEAR and LION”, 3rd International Workshop on Fast Software Encryption, 1996, pp. 113-120.
- P. Golle, S. Jarecki, and I. Mironov.Cryptographic primitives enforcing communication and storage complexity.In ”Financial Cryptography ’02”, volume 2357 of LNCS, pages 120–135. Springer, 2003.
- A. Juels and B. S. Kaliski, Jr. Pors: proofs of retrievability for large files. In ACM CCS ’07, pages 584–597. ACM, 2007
- H. Shacham and B. Waters. Compact proofs of retrievability.In ASIACRYPT ’08, pages 90–107. Springer-Verlag, 2008.
- A.D. Santis and B. Masucci, ‘‘Multiple Ramp Schemes,’’ IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1720-1728, July 1999.
- G.R. Blakley and C. Meadows, ‘‘Security of Ramp Schemes,’’ in Proc. Adv. CRYPTO, vol. 196, Lecture Notes in Computer Science,G.R. Blakley and D. Chaum, Eds., 1985, pp. 242-268.
- M.O. Rabin, ‘‘Efficient Dispersal of Information for Security, Load Balancing, Fault Tolerance,’’ J. ACM, vol. 36, no. 2, pp. 335-348, Apr. 1989.