πŸ“ž +91-7667918914 | βœ‰οΈ ijarcce@gmail.com
International Journal of Advanced Research in Computer and Communication Engineering
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 6, ISSUE 2, FEBRUARY 2017

An Efficient Privacy-Preserving Ranked Keyword Search Method

Prof. Supriya Bhosale, Akshay Khirolkar, Rohit Gaikwad, Bhushan Mirase, Vinod Bakse

πŸ‘ 38 viewsπŸ“₯ 0 downloads
Share: 𝕏 f in ✈ βœ‰
Abstract: As the volume of data in data center is experiencing a tremendous growth, so owner of data prefer to outsource sensitive and important documents for the purpose of privacy conserving .The documents are stored in encrypted format so it is essential to develop efficient search cipher text technique. In the process of encryption relationship between document is concealed which leads to perform deterioration. In this paper a quality hierarchical clustering (QHC) method is proposed to support searching mechanism and to meet fast searching within cloud environment. In this paper multi keyword ranked search hierarchical clustering index (MRSE-HCI) architecture is used. For search result verification, minimum hash sub tree is used. The proposed method has several advantages over traditional method in document’s retrieval and rank privacy.

Keywords: Cloud Computing, Hierarchical Clustering, Security, Cipher text search, multi keyword search, ranked search.

How to Cite:

[1] Prof. Supriya Bhosale, Akshay Khirolkar, Rohit Gaikwad, Bhushan Mirase, Vinod Bakse, β€œAn Efficient Privacy-Preserving Ranked Keyword Search Method,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2017.6295

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