Privacy preserving search over multiple servers
by Ayad Ibrahim; Hai Jin; Ali A. Yassin; Deqing Zou
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 10, No. 4, 2017

Abstract: Search over encrypted data is a hot topic. In this paper, we propose a secure scheme for searching the encrypted servers. Such scheme enables the authorised user to search multiple servers with multi-keyword queries and retrieve the most relevant documents in a descending order with respect to their relevance to the query, without compromising the privacy of his query and the contents of documents he retrieved. In such a setting, each data owner builds his own searchable index, and associates with each document in that index its weight score, which facilitates document ranking. To protect the privacy of these weights, we utilise the privacy preserving mapping (PPM) primitive, while preserving their capability to perform the ranking process. We have conducted several empirical analyses on a real dataset to demonstrate the performance of our proposed scheme.

Online publication date: Tue, 19-Dec-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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