A Unified Framework for Cloud Computing using AES and k-NN Classifier

Authors

  • VARUN KH Dept. of ISE, BNMIT, Bengaluru
  • GS GIRISHA Dept. of ISE, BNMIT, Bengaluru

Keywords:

AES, k-NN classifier, Data Mining over Encrupted Data

Abstract

Data Mining is a way to distillate knowledge from large data sets. Classification consists of predicting a certain outcome based on the given input. Cloud provides the customers to store large amount of data. When classification is done on such large data sets we will know the true potential. But the problem with cloud is that the data is outsourced and anybody can access the data. This has made majority of companies not use the services of cloud. These companies need to give security to customer’s data. One of the ways to provide security to data is by using encryption. But classification cannot be done on encrypted data. This paper addresses the Data Mining over Encrypted Data (DMED) problem. We use the AES and the k-NN classifier to propose a unified framework to provide confidentiality of data.

References

C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proc. 41st Annu. ACM Sympos. Theory Comput., 2009, pp. 169–178.

C. Gentry and S. Halevi, “Implementing gentry’s fully-homomorphic encryption scheme,” in Proc. 30th Annu. Int. Conf. Theory Appl. Cryptographic Techn.: Adv. Cryptol., 2011, pp. 129–148.

A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, pp. 612–613, 1979.

R. Agrawal and R. Srikant, “Privacy-preserving data mining,” ACM Sigmod Rec., vol. 29, pp. 439–450, 2000.

Y. Lindell and B. Pinkas, “Privacy preserving data mining,” in Proc. 20th Annu. Int. Cryptol. Conf. Adv. Cryptol., 2000, pp. 36–54.

P. Zhang, Y. Tong, S. Tang, and D. Yang, “Privacy preserving Naive Bayes classification,” in Proc. 1st Int. Conf. Adv. Data Mining Appl., 2005, pp. 744–752.

L. Xiong, S. Chitti, and L. Liu, “K nearest neighbor classification across multiple private databases,” in Proc. 15th ACM Int. Conf. Inform. Knowl. Manage., 2006, pp. 840–841.

R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 563–574.

X. Xiao, F. Li, and B. Yao, “Secure nearest neighbor revisited,” in Proc. IEEE Int. Conf. Data Eng., 2013, pp. 733–744.

Shivlal Mewada, Sharma Pradeep, Gautam S.S., “Classification of Efficient Symmetric Key Cryptography Algorithms”, International Journal of Computer Science and Information Security (IJCSIS) USA, Vol. 14, No. 2, pp (105-110), Feb 2016 .ISSN: 1947-5500

Shivlal Mewada, Pradeep Sharma, S.S Gautam, “Exploration of Efficient Symmetric AES Algorithm”, Ist IEEE Symposium on Colossal Data Analysis and Networking (CDAN-2016)”, Mar 18th -19th, 2016. ISBN: 978-1-5090-0669-4

B. K. Samanthula, Y. Elmehdwi, and W. Jiang, “k-nearest neighbor classification over semantically secure encrypted relational data,” eprint arXiv:1403.5001, 2014.

Downloads

Published

2025-11-11

How to Cite

[1]
K. VARUN and G. GIRISHA, “A Unified Framework for Cloud Computing using AES and k-NN Classifier”, Int. J. Comp. Sci. Eng., vol. 4, no. 3, pp. 1–5, Nov. 2025.

Issue

Vol. 4 No. 3 (2016): IJCSE Special Issue May Edition

Section

Review Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.