Secure Data Compression Scheme for Scalable Data in Dynamic Data Storage Environments

Authors(2) :-K. Suvetha Bharathi, K. Palanivel

With the continuous and exponential increase of the number of users and the size of their data, data deduplication becomes more and more a necessity for cloud storage providers. By storing a unique copy of duplicate data, cloud providers greatly reduce their storage and data transfer costs. These huge volumes of data need some practical platforms for the storage, processing and availability and cloud technology offers all the potentials to fulfill these requirements. Data deduplicationis referred to as a strategy offered to data providers to eliminate the duplicate data and keeps only a single unique copy of it for storage space saving purpose. This paper, presents a scheme that permits a more fine-grained trade-off. The intuition is that outsourced data may require different levels of protection, depending on how popular content is shared by many users. A novel idea is presented that differentiates data according to their popularity. Based on this idea, an encryption scheme is designed that guarantees semantic security for unpopular data and also provides the higher level security to the cloud data. This way, data de-duplication can be effective for popular data, whilst semantically secure encryption protects unpopular content. Also, the backup recover system can be used at the time of blocking and also analyze frequent login access system.

Authors and Affiliations

K. Suvetha Bharathi
Department of Computer Science, AVC College, Mayiladuthurai, India
K. Palanivel
Department of Computer Science, AVC College, Mayiladuthurai, India

Data storage, Chunks, Similarity matching, Data security, Backup Recovery

  1. X. Zhang, C. Liu, S. Nepal and J. Chen, “An Efficient Quasiidentifier Index based Approach for Privacy Preservation over Incremental Data Sets on Cloud,” Journal of Computer and System Sciences (JCSS), 79(5): 542-555, 2013.
  2. X. Zhang, T. Yang, C. Liu and J. Chen, “A Scalable Two-Phase Top-Down Specialization Approach for Data Anonymization using Systems, in MapReduce on Cloud,” IEEE Transactions on Parallel and Distributed, 25(2): 363-373, 2014.
  3. N. Laptev, K. Zeng and C. Zaniolo, “Very fast estimation for result and accuracy of big data analytics: The EARL system,” Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE), pp. 1296-1299, 2013.
  4. T. Condie, P. Mineiro, N. Polyzotis and M. Weimer, “Machine learning on Big Data,” Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE), pp. 1242-1244, 2013.
  5. Aboulnaga and S. Babu, “Workload management for Big Data analytics,” Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE), pp. 1249, 2013
  6. M. Abadi, D. Boneh, I. Mironov, A. Raghunathan, and G. Segev,“Message-locked encryption for lock-dependent messages,” in Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I, 2013, pp. 374–391.
  7. L. Wang, J. Zhan, W. Shi and Y. Liang, “In cloud, can scientific communities benefit from the economies of scale?” IEEE Transactions on Parallel and Distributed Systems 23(2): 296-303, 2012.
  8. B. Li, E. Mazur, Y. Diao, A. McGregor and P. Shenoy, “A platform for scalable one-pass analytics using mapreduce,” in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'11), 2011, pp. 985-996.
  9. R. Kienzler, R. Bruggmann, A. Ranganathan and N. Tatbul, “Stream as you go: The case for incremental data access and processing in the cloud,” IEEE ICDE International Workshop on Data Management in the Cloud (DMC'12), 2012
  10. C. Olston, G. Chiou, L. Chitnis, F. Liu, Y. Han, M. Larsson, A. Neumann, V.B.N. Rao, V. Sankarasubramanian, S. Seth, C. Tian, T. ZiCornell and X. Wang, “Nova: Continuous pig/hadoop workflows,” Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'11), pp. 1081-1090, 2011.
  11. K.H. Lee, Y.J. Lee, H. Choi, Y.D. Chung and B. Moon, “Parallel data processing with mapreduce: A survey,” ACM SIGMOD Record 40(4): 11-20, 2012.
  12. T. Jiang, X. Chen, Q. Wu, J. Ma, W. Susilo, and W. Lou, “Secure and efficient cloud data Deduplication with randomized tag,” IEEE Trans. Information Forensics and Security, vol. PP, no. 99,
  13. Y. Zhou, D. Feng, W. Xia, M. Fu, F. Huang, Y. Zhang, and C. Li, “Secdep: A user-aware efficient fine-grained secure Deduplication scheme with multi-level key management,” in IEEE 31st Symposium on Mass Storage Systems and Technologies, MSST 2015, Santa Clara, CA, USA, May 30 - June 5, 2015, 2015, pp. 1–14.
  14. Z. Yan, W. Ding, X. Yu, H. Zhu, and R. H. Deng, “Deduplication on encrypted big data in cloud,” IEEE Trans. Big Data, vol. 2, no. 2, pp. 138–150, 2016.
  15.  “Prism (surveillance program),” https://www.theguardian.com/us-news/ prism.
  16. R. Bhaskar, S. Guha, S. Laxman, and P. Naldurg, “Verito: A practical system for transparency and accountability in virtual economies,” in 20th Annual Network and Distributed System Security Symposium, NDSS 2013, San Diego, California, USA, February 24-27, 2013, 2013.
  17. D. Boyd, K. Crawford, S. Shaikh, and V. Ravishankar, “Six provocations for big data,” Six-provocations-for-Big-Data1.pdf.
  18. X. Yang, R. Lu, H. Liang, and X. Tang, “SFPM: A secure and fine-grained privacy-preserving matching protocol for mobile social networking,” Big Data Research, vol. 3, pp. 2–9, 2016.
  19. A. K. Mohan, E. Cutrell, and B. Parthasarathy, “Instituting credibility, accountability and transparency in local service delivery?: helpline and aasthi in karnataka, india,” in International conference on information and communication technologies and development, ICTD 2013, Cape Town, South Africa, December 7-10, 2013, Volume 1: Papers, 2013, pp. 238 247.
  20. D. Boneh, E. Goh, and K. Nissim, “Evaluating 2-dnf formulas on ciphertexts,” in Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, 2005, pp. 325–341.
  21. D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings, 2007, pp. 535–554.
  22. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (3. ed.). MIT Press, 2009.
  23. D. E. Knuth, The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973.
  24. G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved proxy re-encryption schemes with applications to secure distributed storage,” ACM Trans. Inf. Syst. Secur., vol. 9, no. 1, pp. 1–30, 2006.

Publication Details

Published in : Volume 5 | Issue 4 | July-August 2019
Date of Publication : 2019-08-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 229-237
Manuscript Number : CSEIT195439
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

K. Suvetha Bharathi, K. Palanivel, "Secure Data Compression Scheme for Scalable Data in Dynamic Data Storage Environments", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 5, Issue 4, pp.229-237, July-August-2019. Available at doi : https://doi.org/10.32628/CSEIT195439
Journal URL : https://res.ijsrcseit.com/CSEIT195439 Citation Detection and Elimination     |      |          | BibTeX | RIS | CSV

Article Preview