Achieving Security for Data Access Control Using Cryptography Techniques

Authors

  • Dr. V. Vasanthi  Asst.Prof, Department of Computer Science, Rathinam College of Arts and Science, Rathinam Techzone, Coimbatore, Tamil Nadu, India
  • S. Akram Saeed Aglan Alhammadi  Ph.D Research Scholar, Department of Computer Science Rathinam College of Arts and Science, Rathinam Techzone, Coimbatore, Tamil Nadu, India
  • Ramkumar. S  Asst.Prof, Department of Computer Applications, Kalasalingam University, Madurai, Tamil Nadu, India
  • Sathish Kumar  Asst.Prof, Department of Computer Applications, Kalasalingam University, Madurai, Tamil Nadu, India

Keywords:

RSA, Data Mining, DSA, Cryptography, Cloud

Abstract

The amount of data being collected and stored every day by private and public sectors increased dramatically. Almost all industries, organizations and hospitals are maintaining personal information about individuals for decision making or pattern recognition. Security risk is very high while sharing this personal sensitive information among different data collectors. Therefore, privacy-preserving processes have already been developed to sanitize confidential information beginning with the samples while keeping their utility. For that safe and secure distributed computation new privacy preserving data mining algorithm has been developed. The main goal of these algorithms is to prevent that sensible information from hackers, during knowledge extraction from voluminous data. This work presents a protection saving approach that could be connected to decision tree learning, without associative misfortune of precision. This approach changeover the definitive specimen information sets into a gathering of undiscovered information sets, from which definitive information examines can't be remade without the whole assembly of unbelievable information sets. In the mean time, a proficient and precise decision tree might be manufactured straightforwardly from those stunning information sets. This novel methodology might be connected straightforwardly to the information space when the first sample is gathered. The methodology is versatile with other protection preserving approaches, for example, cryptography for extra protection.

References

  1. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar, “On the privacy preserving properties of random data perturbation techniques” In Proc. of 3rd IEEE Int. Conf. on Data Mining, Washington, DC, USA,, pages99?106, 2003.
  2. R.Agarwal and R.Srikant, “Privacy preserving data mining”, In Procseedings of the 19th ACM SIGMOD conference on Management of Data ,Dallas,Texas,USA, May2000
  3. J. Canny, “Collaborative filtering with privacy”. In IEEE Symposium on security and privacy , pages 45-57 Oakland, May 2002.
  4. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar, “On the privacy preserving properties of random data perturbation techniques”, In Proceedings of the 3rd IEEE International Conference on Data Mining, pages 99?106, Melbourne, Florida, November 19-22, 2003.
  5. C. Aggarwal and P. Yu, Privacy-Preserving Data Mining:, Models and Algorithms. Springer, 2008.restoneTireRecall.htm, May 2001.
  6. Hillol Kargupta ,souptik data,Qi wang and Krishnamoorthy sivakumar,”random data Perturbation technique and privacy preserving data mining ”,IEEE international conference on data mining, 2003.
  7. Xiaokui Xiao, Yufei Tao and Minghua Chen,” Optimal Random Perturbation at Multiple Privacy Levels”, ACM. VLDB ‘09, August 24-28, 2009, Lyon, France
  8. Keke Chen Ling Liu,” Privacy-preserving Multiparty Collaborative Mining with Geometric Data Perturbation”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED COMPUTING, VOL. XX, NO. XX, JANUARY 2009
  9. Alka gangrade, ravindra patel,” building privacy-preserving c4.5 Decision tree classifier on multiparties,” international journal on computer science and engineering vol.1(3), 2009, 199-205
  10. p.kamakshi , dr.a.vinaya babu,” preserving privacy and sharing the data in distributed environment using cryptographic technique on perturbed data,” journal of computing, volume 2, issue 4, april 2010, issn 2151?9617
  11. Mohammad Ali Kadampur, Somayajulu D.V.L.N,” A Noise Addition Scheme In Decision Tree For Privacy Preserving Data Mining,” Journal Of Computing, Volume 2, Issue 1, January 2010, Issn 2151-9617
  12. Li Liu Murat Kantarcioglu and Bhavani Thuraisingham,” Privacy Preserving Decision Tree Mining from Perturbed Data,” Proceedings of the 42nd Hawaii International Conference on System Sciences - 2009
  13. M. Naga lakshmi, k sandhya rani,”? a privacy preserving clustering method based on fuzzy approach and random rotation perturbation.” Publications of problems & application in engineering research, vol 04, special issue01; 2013
  14. V.Thavavel and S.Sivakumar,” A generalized Framework of Privacy Preservation in Distributed Data mining for Unstructured Data Environment,” International Journal of Computer Science Issues, Vol. 9, Issue 1, No 2, January 2012
  15. Pui k. Fong and jens h. Weber-jahnke,” privacy preserving decision tree learning using unrealized data sets,” ieee transactions on knowledge and data engineering, vol. 24, no. 2, february 2012
  16. S.nithya and p.senthil vadivu,” efficient decision tree based privacy preserving Approach for unrealized data sets,” international journal of advances in computer science and technology, 2(6), june 2013, 83 - 89
  17. Seema kedar, sneha dhawale, wankhade vaibhav,” privacy preserving data mining,” international journal of advanced research in computer and communication engineering vol. 2, issue 4, april 2013
  18. Justin Brickell and Vitaly Shmatikov,” Privacy-Preserving Classi_er Learning”,
  19. Keke chen ling liu,” privacy-preserving multiparty collaborative mining with geometric data perturbation”, ieee transactions on parallel and distributed computing, vol. Xx, no. Xx, january 2009
  20. S.L. Wang and A. Jafari, “Hiding Sensitive Predictive Association Rules,” Proc. IEEE Int’l Conf. Systems, Man and Cybernetics, pp. 164-169, 2005.
  21. Q. Ma and P. Deng, “Secure Multi-Party Protocols for Privacy Preserving Data Mining,” Proc. Third Int’l Conf. Wireless Algo-rithms, Systems, and Applications (WASA ’08), pp. 526-537, 2008
  22. J. Gitanjali, J. Indumathi, N.C. Iyengar, and N. Sriman, “A Pristine Clean Cabalistic Foruity Strategize Based Approach for Incre-mental Data Stream Privacy Preserving Data Mining,” Proc. IEEE Second Int’l Advance Computing Conf. (IACC), pp. 410-415, 2010.
  23. L. Liu, M. Kantarcioglu, and B. Thuraisingham, “Privacy Preser-ving Decision Tree Mining from Perturbed Data,” Proc. 42nd Hawaii Int’l Conf. System Sciences (HICSS ’09), 2009.
  24. Y. Zhu, L. Huang, W. Yang, D. Li, Y. Luo, and F. Dong, “Three New Approaches to Privacy-Preserving Add to Multiply Protocol and Its Application,” Proc. Second Int’ l Works hop Knowledge Discovery and Data Mining, (WKDD ’09), pp. 554-558, 2009.
  25. M. Shaneck and Y. Kim, “Efficient Cryptographic Primitives for? Private Data Mining,” Proc. 43rd Hawaii Int’l Conf. System Sciences (HICSS), pp. 1-9, 2010.
  26. J. Vaidya and C. Clifton. Privacy-preserving decision trees over vertically partitioned data. In Proceedings of the 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Storrs,Connecticut, 2005. Springer. L. Liu, M. Kantarcioglu, and B. Thuraisingham, “Privacy Preserving Decision Tree Mining from Perturbed Data,” Proc. 42nd Hawaii Int’l Conf. System Sciences (HICSS ’09), 2009.
  27. S. Ajmani, R. Morris, and B. Liskov, “A Trusted Third-Party Computation Service,” Technical Report MIT-LCS-TR-847, MIT, 2001.
  28. Lian Liu.,Jie Wang.,Jun Zhang., ``Wavelet based data perturbation for simultaneous privacy preserving and statistics preserving.,'' In Proceedings of IEEE International Conference on Data Mining workshop., 2008.

Downloads

Published

2017-04-30

Issue

Section

Research Articles

How to Cite

[1]
Dr. V. Vasanthi, S. Akram Saeed Aglan Alhammadi, Ramkumar. S, Sathish Kumar, " Achieving Security for Data Access Control Using Cryptography Techniques, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 3, Issue 5, pp.172-182, May-June-2017.