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

Building Confidential & Efficient Query Services in the Cloud with RASP Perturbation

A Rebekah Johnson, N.Parashuram, Dr S.Prem Kumar, ,
(M.Tech), CSE
Assistant Professor, Department of Computer Science and Engineering
Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.

In this paper Cloud computing infrastructures are popularly used by peoples now a days. By using cloud users can save their cost for query services. But some of the data owners are hesitate to put their data’s in cloud because, sometimes the data may be hack when they use in cloud unless the confidentiality of data and secure query processing will be provided by the cloud provider.However, some data might be sensitive that the data owner does not want to move to the cloud unless the data confidentiality and query privacy are guaranteed. We propose the Random Space Encryption (RASP) approach that allows efficient range search with stronger attack resilience than existing efficiency-focused approaches. The random space perturbation (RASP) data perturbation method to provide secure and efficient range query and kNN query services for protected data in the cloud. The RASP data perturbation method combines order preserving encryption, dimensionality expansion, random noise injection, and random projection, to provide strong resilience to attacks on the perturbed data and queries. It also preserves multidimensional ranges, which allows existing indexing techniques to be applied to speedup range query processing. The kNN-R algorithm is designed to work with the RASP range query algorithm to process the kNN queries.

A Rebekah Johnson,N.Parashuram,Dr S.Prem Kumar."Building Confidential & Efficient Query Services in the Cloud with RASP Perturbation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 09,pp.627-630, SEPTEMBER - 2015, URL :,

Keywords : RASP Method, query services in the cloud, privacy, range query, kNN query.

[1] Xu, H., Guo, S., and Chen, K. ―Building confidential and efficient query services in the cloud with RASP data perturbation‖, IEEE Transactions on Knowledge and Data Engineering 26, 2 (2014). 
[2] K. Chen, R. Kavuluru, and S. Guo, ―RASP: Efficient Multidimensional Range Query on Attack-Resilient Encrypted Databases,‖ Proc. ACM Conf. Data and Application Security and Privacy, pp. 249-260, 2011. 
[3] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, ―Order Preserving Encryption for Numeric Data,‖ Proc. ACM SIGMOD Int’l Conf. Management of Data (SIGMOD), 2004.
 [4] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.K. Andy Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, ―Above the Clouds: A Berkeley View of Cloud Computing,‖ technical report, Univ. of Berkerley, 2009. 
[5] J. Bau and J.C. Mitchell, ―Security Modeling and Analysis,‖ IEEE Security and Privacy, vol. 9, no. 3, pp. 18- 25, May/June 2011. 
[6]. 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. 
[7]. 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.
 [8]. 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.
 [9] 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. 
[10]. 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. 
[11]. 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.
 [12]. 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.


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