Volume- 5
Issue- 3
Year- 2017
DOI: 10.21276/ijircst.2017.5.3.7 | DOI URL: https://doi.org/10.21276/ijircst.2017.5.3.7
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Bhagyashree Ambulkar , Prof. Gunjan Agre
Data mining has been used in various areas, for example crime agencies, retail industries, financial data analysis, telecommunication industry, biological, among government agencies, etc. Several application handle very delicate data. So these data remains secure and private. In data mining, Classification could be the one of the major task. Going back two full decades various privacy issues are occurs so that many conceptual and feasible solutions to the classification problem have been developed. Similarly daily cloud user is increment tremendously and they have a big possibility to process the offload the information an encrypted form. The information in the cloud has been in encrypted form, recent privacy preserving classification systems are not feasible. In this paper, our proposed hybrid method provides privacy -preserving classifier for encrypted data of relational database and also achieves the marginally better performance for extracting information using k-NN algorithm from encrypted data of relational databases. This paper describes AES encryption technique which is highly secure and efficient.
[1] Bhagyashree Ambulkar, Prof. Gunjan Agre, “Fast Search Processing Over Encrypted Relational Data Using K-Nearest Neighbour Algorithm”, International Journal on Recent and Innovation Trends in Computing and Communication Volume: 5 Issue: 4 , ISSN: 2321-8169 , 398 – 401 , May 2017
[2] Bharath K. Samanthula,Yousef Elmehdwi,Wei Jiang,"k-Nearest Neighbor Classification over Semantically Secure Encrypted Relational Data", IEEE Transactions On Knowledge And Data Engineering, Vol. 27, No. 5, May 2015.
[3] E.Vani, S.Veena, D.John Aravindar, "Query Processing Using Privacy Preserving k-NN Classification Over Encrypted Data", International Conference On Information Communication And Embedded System (ICICES), 978-1-5090-2552-7, 2016.
[4] Zhihua Xia, Xinhui Wang, Xingming Sun, Qian Wang,"A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data",IEEE Transactions On Parallel And Distributed Systems, Vol. 27, No. 2, February 2016.
[5] Yousef Elmehdwi, Bharath K. Samanthula, Wei Jiang, "Secure k-Nearest Neighbor Query over Encrypted Data in Outsourced”, ICDE IEEE Conference,978-1-4799-2555-1/14/$31.00 © 2014. [6] Z. Wang , J. Dai, W. Wang and B. L. Shi,” Fast Query over Encrypted Character Data in Database” Communications in Information and Systems, pp. 289-300.
[7] Z. Wang, W. Wang and B. Shi , “ Storage and Query over Encrypted Character and Numarical Data in Database”, Proceedings of the 2005 The Fifth International Conference on Computer and Information Technology, pp. 77-81,2005
[8] Manish Sharma , Atul Chaudhary, Santosh Kumar, “ Query Processing Performance and Searching over Encrypted Data by using an Efficient Algorithm”,International Journal of Computer Applications (0975 – 8887) Volume 62– No.10, January 2013
[9] Kavyashree J, Deepika N, “Secured Access to Cloud Data through Encryption and Top-K Retrieval Using Multiple Keywords”, International Journal of Science and Research (IJSR) ISSN (Online): 2319-706
[10] Maleq Khan, Qin Ding and William Perrizo, “K-Nearest Neighbor Classification on Spatial Data Streams Using P-Trees".
[11] http://www.bowdoin.edu/~ltoma/teaching/cs340/spring08/ Papers/Rtree-chap1.pdf
[12] Jinka Sravana , Suba. S, “Applying R Trees In Non Spatial Multidimensional Databases”, International Journal Of Technology Enhancements And Emerging Engineering Research, Vol 2, Issue 7 28 Issn 2347-4289
[13] Bhagyashree Ambulkar, Prof. Gunjan Agre, “Fast Search Processing Over Encrypted Relational Data Using K-Nearest Neighbor Algorithm“,International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), May 2017 Volume 5 Issue 5.
[14] J. Han and M. Kamber, “Data Mining Concepts and Techniques”, Elevier, 2011.
[15] Bruce Schneier; John Kelsey; Doug Whiting; David Wagner; Chris Hall; Niels Ferguson; Tadayoshi Kohno; et al. (May 2000). "The Twofish Team's Final Comments on AES Selection" (PDF). Nahan Rahman M.K., “Inviolable Data mining in Cloud using AES and Paillier Cryptosystem”, International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE) International Conference on Recent Trends in Computing and Communication (ICRTCC 2015) Cochin College of Engineering & Technology Vol. 4, Special Issue 1, June 2015, ISSN (Online) 2278-1021, ISSN (Print) 2319-5940
[16] http://www.tutorialspoint.com/cryptography/advanced_encr yption_standard.htm
[17] Bruce Schneier; John Kelsey; Doug Whiting; David Wagner; Chris Hall; Niels Ferguson; Tadayoshi Kohno; et al. "The Twofish Team's Final Comments on AES Selection" , May 2000
[18] Atul Kahate, “Cryptography and Network Security”, TMH Publication
[19] Jiawei Han, Micheline Kamber, Jian Pei, “Data Mining : Concepts and Techniques”, Morgen Kaufmann” 2001
[20] T. Cover and P. Hart, “Nearest Neighbor pattrern classification”, IEEE Trans. Information Theory, 1996
[21] Hong Rong, Huimei Wang, Jian Liu, and Ming Xian, "Privacy-Preserving k-Nearest Neighbor Computation in Multiple Cloud Environments",IEEE, 2169-3536 (c) 2016.
M. Tech. Scholar, Department of Computer Science and Engineering, Nagpur Institute of Technology, Nagpur, Nagpur, Maharashtra, India, 9763316989.
No. of Downloads: 11 | No. of Views: 6054
Anshjyot Singh Wadhwa.
September 2024 - Vol 12, Issue 5
Mohammad Hashir, Sanskar Mishra, Yojna Arora, Avinash Kumar Sharma.
September 2024 - Vol 12, Issue 5
Mohit Apte.
July 2024 - Vol 12, Issue 4