Secure ranked multi-keyword search based on modified blowfish algorithm and AVL tree in untrusted cloud environment

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Advancement in cloud services growing day by day motivates a huge number of data proprietors to store their valuable data in cloud servers. For privacy issue, datasets that contain sensitive information are encrypted first and then outsourced into the cloud server. In this paper, ranked multi keyword search based on AVL tree, especially for several data owners, has been proposed. To avoid unauthorized access, the proposed work encrypts the data using a Modified Blowfish (MB) algorithm before outsourcing. MB algorithm introduces # operation instead of normal OR operation in conventional blowfish algorithm. This MB algorithm provides robustness against any intruding whereas the conventional blowfish algorithm insecure for many applications. To achieve a proficient search, every data owner’s index based on AVL tree is encrypted by way of additive order and the privacy-preserving family is formed. The cloud server is then permitted to combine these indexes effectually without knowing the index content. An Iterative Deepening Depth First Search (IDDFS) procedure is used to discover the matching file for the data user request. Finally, our proposed work provides secure data outsourcing to cloud server compared to the other existing methods. The proposed work considers three metrics for the performance evaluation process, viz. precision, index construction time and search time.

Cite

CITATION STYLE

APA

Swami, R., & Das, P. (2019). Secure ranked multi-keyword search based on modified blowfish algorithm and AVL tree in untrusted cloud environment. International Journal of Engineering and Advanced Technology, 9(1), 6738–6744. https://doi.org/10.35940/ijeat.A2041.109119

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free