Solving Classification Issues Over Encrypted Data

Shubham Bhaskar; Arindam Das; Swarnika Shubham; Mrs. Sridevi G.M

doi:https://doi.org/10.14445/22315381/IJETT-V35P229

Research Article | Open Access | Download PDF

Volume 35 | Number 1 | Year 2016 | Article Id. IJETT-V35P229 | DOI : https://doi.org/10.14445/22315381/IJETT-V35P229

Solving Classification Issues Over Encrypted Data

Shubham Bhaskar, Arindam Das, Swarnika Shubham, Mrs. Sridevi G.M

Citation :

Shubham Bhaskar, Arindam Das, Swarnika Shubham, Mrs. Sridevi G.M, "Solving Classification Issues Over Encrypted Data," International Journal of Engineering Trends and Technology (IJETT), vol. 35, no. 1, pp. 135-138, 2016. Crossref, https://doi.org/10.14445/22315381/IJETT-V35P229

Abstract

Data Mining and Cloud computing are the two very technologies that makes the classification and storage of the data so simple. The classification tasks of data mining is very useful, however it leads to certain privacy issues. Hence, several solutions have been suggested over the years. With the invention of cloud computing users can now outsource their data over to the cloud along with several data mining tasks that can be performed there. Even if the cloud provides so splendid features, it however gives rise to certain security issues which makes data storage difficult. So, the data is uploaded over it in ‘encrypted form’ to ensure encryption of data. The classification technique, however, does not apply over the ‘encrypted data’. Hence, we aim to solve the classification (k-NN Classifier) problem over the encrypted data.

Keywords

Security, k-NN Classifier, Encryption

References

[1] National Institute of Standards and Technology`s (NIST) “definition of cloud”.
[2] C. Gentry, “Fully homomorphic encryption using ideal lattices,” in ACM STOC, pp. 169–178, 2009.
[3] A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, pp. 612–613, Nov. 1979.
[4] B. K. Samanthula, Y. Elmehdwi, and W. Jiang, “k-nearest neighbor classification over semantically secure encrypted relational data.” print arXiv:1403.5001, 2014.
[5] R. Agrawal and R. Srikant, “Privacy- preserving data mining,” in ACM Sigmod Record, vol. 29, pp. 439–450, ACM, 2000.
[6] Y. Lindell and B. Pinkas, “Privacy preserving data mining,” in Advances in Cryptology (CRYPTO), pp. 36–54, Springer, 2000.
[17] L. Xiong, S. Chitti, and L. Liu, “K nearest neighbor classification across multiple private databases,” in CIKM, pp. 840–841, ACM, 2006.
[18] Y. Qi and M. J. Atallah, “Efficient privacy-preserving k-nearest neighbor search,” in IEEE n ICDCS, pp. 311–319, 2008.
[19] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in ACM SIGMOD, pp. 563– 574, 2004.
[20] H. Hacig¨um¨us¸, B. Iyer, C. Li, and S. Mehrotra, “Executing sql over encrypted data in the database-service-provider model,” in ACM SIGMOD, pp. 216–227, 2002.
[21] B. Hore, S. Mehrotra, M. Canim, and M. Kantarcioglu, “Secure multidimensional range queries over outsourced data,” The VLDB Journal, vol. 21, no. 3, pp. 333–358, 2012.
[22] W. K. Wong, D. W.-l. Cheung, B. Kao, and N. Mamoulis, “Secure knn computation on encrypted databases,” in ACM SIGMOD, pp. 139–152, 2009.