Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

A Survey on Data Perturbation with Encrypted Data Transfer

Swathi.C, Sharmila.K, Sujitha.T, K.B.Aruna, ,
Computer Science and Engineering, S.A. Engineering college, Chennai -600077

An application that is utilized to recover information from the vast database is troublesome in numerous divisions like IT and furthermore in government parts and associations. In this way, the reaction time will be low. For this reason, we propose a technique called RASP information irritation to give secure and efficient range question and KNN inquiry administrations. By utilizing this strategy, we can recover information rapidly. The KNN-R calculation is intended to work with the RASP go inquiry calculation to process the KNN questions. In this way, the recovery of data from the vast database is snappy and straightforward and furthermore, the reaction time will be high the principle favourable position of utilizing this calculation is reaction time. The analysis of data on threats and queries under precisely defined threat model was done to improve the security. So, the recoup of data from an extensive database is very easy and quick and also the response time will be very high. The main advantage of using this algorithm is response time

Swathi.C,Sharmila.K,Sujitha.T, K.B.Aruna.(2018). A Survey on Data Perturbation with Encrypted Data Transfer. International Journal of Computer Engineering In Research Trends, 5(2), 30-33. Retrieved from

Keywords : RASP, KNN, range query, threat model, security, response time.

[1] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, "Order-preserving encryption for numeric data," in Proceedings of ACM SIGMOD Conference, 2004.

[2] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. K. and Andy Konwinski, G. Lee, D. Patterson, A. Rabkin,I. Stoica, and M. Zaharia, "Above the clouds: A Berkeley view of cloud computing," Technical  Report, University of Berkeley, 2009.

[3] J. Bau and J. C. Mitchell, "Security modelling and analysis," IEEE Security and Privacy, vol. 9, no. 3, pp. 18–25,2011.	

[4] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
[5] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over encrypted cloud data,” in INFOCOMM, 2011.

[6] K. Chen, R. Kavuluru, and S. Guo, “Investigation on Privacy and Secure content of location based Queries,” in ACM Conference on Data and Application Security and Privacy, 2011, pp. 249–260.

[7]  B.Kundan, N.Poorna Chandra Rao,Dr S.Prem Kumar, “Geometric data perturbation for outsourced data mining,” International Journal of Computer Engineering in Research Trends,vol.2,no.9, pp. 543-546,2015. 

[8] K. Chen, L. Liu, and G. Sun, “Towards attack-resilient geometric data perturbation,” in SIAM Data Mining Conference, 2007.

[9] B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, “Private information retrieval,” ACM Computer Survey, vol. 45, no. 6, pp. 965–981, 1998.

[10] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proceedings of the 13th ACM conference on Computer and communications security. New York, NY, USA: ACM, 2006, pp. 79–88.

[11] N. R. Draper and H. Smith, Applied Regression Analysis. Wiley, 1998.

[12] H. Hacigumus, B. Iyer, C. Li, and S. Mehrotra, "Executing SQL over encrypted data in the database-service-provider model," in Proceedings of ACM SIGMOD Conference, 2002.

[13] T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning. Springer-Verlag, 2001.

[14] Prof. R. Poorvadevi, S.Keerthana, V.S. Ghethalaxmipriya, K. Venkatasailokesh,,” An Enforcement of Guaranteed Client Level Defensive Mechanism in Public Cloud Services”. International Journal of Computer Engineering in Research Trends,vol.4,no.2, pp. 20-24,2017.

[15] K.Samunnisa, Maloth Bhavsingh, “Privacy-Preserving Scalar Product Computation over Personal Health Records International Journal of Computer Engineering in Research Trends,vol.3,no.12, pp. 42-47,2016.
[16] A. Hyvarinen, J. Karhunen, and E. Oja, Independent Component Analysis. Wiley, 2001.

[17] I. T. Jolliffe, Principal Component Analysis. Springer, 1986.

[18] F. Li, M. Hadjieleftheriou, G. Kollios, and L. Reyzin, “Dynamic authenticated index structures for outsourced databases,” in Proceedings of ACM SIGMOD Conference, 2006.

[19] K. Liu, C. Giannella, and H. Kargupta, “An attacker’s view of distance preserving maps for privacy preserving data mining,” in Proceedings of PKDD, Berlin, Germany, September 2006.

[20] M. L. Liu, G. Ghinita, C. S.Jensen, and P. Kalnis, “Enabling search services on outsourced private spatial data,” The International Journal of on Very Large Data Base, vol. 19, no. 3, 2010.

[21] Y. Manolopoulos, A. Nanopoulos, A. Papadopoulos, and Y. Theodoridis, R-trees: Theory and Applications. Springer-Verlag, 2005.

[22] R. Marimont and M. Shapiro, “Nearest neighbour searches and the curse of dimensionality,” Journal of the Institute of Mathematics and its Applications, vol. 24, pp. 59–70, 1979.

[23] M. F. Mokbel, C. yin Chow, and W. G. Aref, “The new casper: Query processing for location services without compromising privacy,” in Proceedings of Very Large Databases Conference (VLDB), 2006, pp. 763–774.

[24] P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in EUROCRYPT. Springer-Verlag, 1999, pp. 223–238.

[25] S. Papadopoulos, S. Bakiras, and D. Papadias, “Nearest neighbor search with strong location privacy,” in Proceedings of Very Large Databases Conference (VLDB), 2010.

[26] F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.

[27] M. Rudelson and R. Vershynin, “Smallest singular value of a random rectangular matrix,’’Communications on Pure and Applied Mathematics, vol. 62, pp. 1707–1739, 2009.

[28] E. Shi, J. Bethencourt, T.-H. H. Chan, D. Song, and A. Perrig, “Multi-dimensional range query over encrypted data,” in IEEE Symposium on Security and Privacy, 2007.

[29] R. Sion, “Query execution assurance for outsourced databases,” in Proceedings of Very Large Databases Conference (VLDB), 2005.

[30] C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS), 2010.

[31] P. Williams, R. Sion, and B. Carbunar, “Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage,” in ACM Conference on Computer and Communications Security, 2008.

[32] W. K. Wong, D. W.-l. Cheung, B. Kao, and N. Mamoulis, “Secure knn computation on encrypted databases,” in Proceedings of ACM SIGMOD Conference. New York, NY, USA: ACM, 2009, pp. 139–152.

[33] M. Xie, H. Wang, J. Yin, and X. Meng, “Integrity auditing of outsourced data,” in Proceedings of Very Large Databases Conference (VLDB), 2007, pp. 782–793.

[34] H. Xu, S. Guo, and K. Chen, “Building confidential and efficient query services in the cloud with rasp data perturbation,” Wright State Technical Report,,
[35] M. L. Yiu, C. S. Jensen, X. Huang, and H. Lu, “Spacetwist: Managing the trade-offs among location privacy, query performance, and query accuracy in mobile services,” in Proceedings of IEEE International Conference on Data. 

DOI Link :

Download :

Refbacks : Currently there are no refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal