Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Call For Paper : Vol 11, Issue 03, March 2024

Call for Paper

Vol 11, Issue 03, March 2024

Indexing

“Implementation of file level and block level deduplication and detecting attacks in cloud environment.”

Author : Prof. Samita Mokal 1 Prof. Nilima Nikam 2 Prof. Vaishali Londhe 3

PDF

Date of Publication :24th August 2017

Abstract: In cloud computing, security and storage space management techniques are most important factors for improving the performance of cloud computing. Secure deduplication is a technique for eliminating duplicate copies of storage data, and provides security to them. To reduce storage space and upload bandwidth in cloud storage deduplication has been a well-known technique.. The basic idea in this paper is that we can eliminate duplicate copies of storage data and limit the damage of stolen data if we decrease the value of that stolen information to the attacker. This paper makes the first attempt to formally address the problem of achieving efficient and reliable key management in secure deduplication. we propose Sekey, User Behavior Profiling and Decoys technology. Sekey new construction in 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 proof of concept, we implement Sekey using the Ramp secret sharing scheme and demonstrate that Sekey incurs limited overhead in realistic environments. User profiling and decoys, then, serve two 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. We posit that the combination of these security features will provide unprecedented levels of security for the deduplication in insider and outsider attacker..

Reference :

    1. Jin Li, Xiaofeng Chen, Mingqiang Li, Jingwei Li, Patrick P.C. Lee, and Wenjing louieee ,Secure Deduplication with Efficient and Reliable Convergent Key Management. IEEE transactions on parallel and distributed systems, vol. 25, no. 6, june 2014
    2. 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
    3. Abdul Wahid Soomro, Nizamuddin, Arif Iqbal Umar, Noorul Amin.”Secured Symmetric Key Cryptographic Algorithm for Small Amount of Data” 3rd International Conference on Computer & Emerging Technologies (ICCET 2013)
    4. M.W. Storer, K. Greenan, D.D.E. Long, and E.L. Miller, „„Secure Data Deduplication,‟‟ in Proc. StorageSS, 2008, pp. 1-10.
    5. W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer, “Feasibility of a Serverless istributed File System Deployed on an Existing Set of Desktop PCs”, SIGMETRICS 2000, ACM, 2000, pp.34-43
    6. 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
    7. A.D. Santis and B. Masucci, „„Multiple Ramp Schemes,‟‟ IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1720-1728, July 1999.
    8. 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.
    9. M.O. Rabin, „„Efficient Dispersal of Information for Security, Load Balancing, Fault Tolerance,‟‟ J. ACM, vol. 36, no. 2, pp. 335- 348, Apr. 1989.
    10. A. Shamir, „„How to Share a Secret,‟‟ Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
    11. NIST‟s Policy on Hash Functions, Sept. 2012. [Online]. Available: http://csrc. nist. gov/ groups/ST /hash/policy.html.
    12. AmazonCase Studies. [Online]. Available: https://aws.amazon. com/solutions/case-studies/#backup.
    13. P. Anderson and L. Zhang, „„Fast and Secure Laptop Backups with Encrypted De-Duplication,‟‟ in Proc. USENIX LISA, 2010, pp. 1-8.
    14. M. Bellare, S. Keelveedhi, and T. Ristenpart, „„Message-Locked Encryption and Secure Deduplication,‟‟ in Proc. IACR Cryptology ePrint Archive, 2012, pp. 296-3122012:631.
    15. 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.
    16. 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.
    17. J. Gantz and D. Reinsel, The Digital Universe in 2020: Big Data, Bigger Digital Shadows, Biggest Growth in the Far East, Dec. 2012. [Online]. Available: http://www.emc.com/collateral/analystreports/ idc-thedigital-universe-in-2020.pdf.
    18. S. Halevi, D. Harnik, B. Pinkas, and A. Shulman-Peleg, „„Proofs of Ownership in Remote Storage Systems,‟‟ in Proc. ACM Conf. Comput. Commun. Security, Y. Chen, G. Danezis, and V. Shmatikov, Eds., 2011, pp. 491-500
    19. D. Harnik, B. Pinkas, and A. Shulman-Peleg, „„Side Channels in Cloud Services: Deduplication in Cloud Storage,‟‟ IEEE Security Privacy, vol. 8, no. 6, pp. 40-47, Nov./Dec. 2010.
    20. S. Kamara and K. Lauter, „„Cryptographic Cloud Storage,‟‟ in Proc. Financial Cryptography: Workshop Real-Life Cryptograph. Protocols Standardization, 2010, pp. 136-149.

Recent Article