Ranked Query Support in Untrusted Cloud without Reveal Sensitive Data
B. Seetharamulu, Dr.G.V. Uma, , ,
Now-a-days Cloud computing is become more popular as cloud infrastructure for storing the data. Data owners are stored their
data in public cloud for the flexibility and cost-preserving. In order to providing data privacy, Clouds allow users to store data and access can
be made anywhere, any time by using any device. Highly sensitive information such as business documents, medical records and personal
information may be stored in a cloud. Security and privacy are thus very important issues in cloud computing. To keep user data confidential
from an untrusted Cloud Service Provider and third parties, a natural way is encryption. The data decryption key should be disclosed only to
users who have been authorized. Users can search their files using keywords in the cloud. In existing literature many schemes have been
proposed. In this paper, a new technique is described: Ranked Query support in Untrusted Cloud without Reveal Sensitive Data. Which
performs operations on encrypted data which will provide results without decrypting that data? It provides privacy for user querying patterns
and user data. It allows Cloud Service Providers to perform operations on the encrypted data. The Cloud Service Provider is unaware of the
files and keywords stored in the cloud. Ranking is used for efficient and fast retrieval of the desired files. Ranks will be assigned to files
based on the frequency of access of the files.
B. Seetharamulu,Dr.G.V. Uma."Ranked Query Support in Untrusted Cloud without Reveal Sensitive Data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 05,pp.369-371, May- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I518.pdf,
Keywords : Cloud computing security, keyword search, Multidimensional Range Query, Random Space Encryption, consumer-centric
cloud, Hybrid storage systems, and approximate queries.
 Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2014). â€œPrivacypreserving multi-keyword ranked search over encrypted cloud data.â€Parallel and Distributed Systems, IEEE Transactions on, 25(1), 222-233.
 Wei, L., & Reiter, M. K. (2011). â€œThird-party DFA evaluation on encrypted filesâ€. Tech. Rep. TR11-005, Department of Computer Science, University of North Carolina at Chapel Hill.
 Xu, H., Guo, S., & Chen, K. (2012). â€œBuilding confidential and efficient query services in the cloud with RASP data perturbationâ€. arXiv preprint arXiv:1212.0610.
 Wang, C., Cao, N., Li, J., Ren, K., & Lou, W. (2010, June). â€œSecure ranked keyword search over encrypted cloud data.â€ In Distributed Computing Systems (ICDCS), 2010 IEEE 30th International Conference on (pp. 253-262). IEEE.
 Liu, Q., Tan, C. C., & Wang, G. (2014). â€œTowards Differential Query Services in Cost-Efficient Clouds.â€ Parallel and Distributed Systems, IEEE Transactions on,25(6), 1648-1658.
 Hua, Y., Xiao, B., Veeravalli, B., & Feng, D. (2012). â€œLocalitysensitive Bloom filter for approximate membership query.â€ Computers, IEEE Transactions on,61(6), 817-830.
 Liu, Q., Tan, C. C., Wu, J., & Wang, G. (2012, March). â€œEfficient information retrieval for ranked queries in cost-effective cloud environments.â€ In INFOCOM, 2012 Proceedings IEEE (pp. 2581- 2585). IEEE.
 Cabarcos, P. A., Mendoza, F. A., Guerrero, R. S., Lopez, A. M., & Diaz-Sanchez, D. (2012). Telematic Eng. Dept., Carlos III Univ. of Madrid, Leganes, Spain. Consumer Electronics, IEEE Transactions on, 58(4), 1425-1433.
 Fu, Z., Sun, X., Linge, N., & Zhou, L. (2014). â€œAchieving effective cloud search services: multi-keyword ranked search over encrypted cloud data supporting synonym query.â€ Consumer Electronics, IEEE Transactions on, 60(1), 164-172.
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
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
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.