Secure and privacy-preserving multi-keyword ranked information retrieval from encrypted big data Online publication date: Wed, 05-Aug-2020
by Lija Mohan; Sudheep Elayidom M.
International Journal of Information and Computer Security (IJICS), Vol. 13, No. 2, 2020
Abstract: Cloud deployment raises some security challenges to the confidentiality of data, and the privacy of users. These challenges, along with the pressing demand for adopting big data technologies, together call for the development of stronger encryption algorithms. But encrypting the data makes it difficult to retrieve the most matching documents with respect to the query keywords. Therefore, the authors propose a solution for the ranked encrypted information retrieval, using the modified homomorphic encryption scheme (MHE) still preserving user's privacy. The scheme efficiently utilises the processing power of the cloud server to compute the similarity scores, leaving the decryption and ranking to the client side, thus ensuring the security of the data. Vector space model and term frequency-inverse document frequency (TF-IDF) concepts are used for similarity matching. The execution is then accelerated using a Hadoop cluster and is found to be accurate, efficient, scalable and practical for real world applications.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook