Encrypted similarity search feasible of keyword index search schemes
by Hyun-A Park
International Journal of Internet Technology and Secured Transactions (IJITST), Vol. 6, No. 3, 2016

Abstract: Encrypting information has been regarded as one of the most substantial approaches to protect users' sensitive information in radically changing current and future computing environments, especially for cloud datacentre whose server manager cannot be guaranteed trustworthy. In prior research, researchers have considered similarity search over encrypted documents infeasible, because the single-bit difference of a plaintext would result in an enormous bits difference in the corresponding ciphertext. However, this work proposes a novel idea of encrypted similarity search feasible of keyword index search schemes (ESS-KIS) over encrypted documents by applying character-wise encryption with approximate string matching to keyword index search systems. The security requirements of similarity search over encrypted data are defined, and two similarity search schemes are proposed. The first scheme is more efficient, while the second scheme achieves perfect similarity search privacy. Surprisingly, the second scheme turns out to be faster than other keyword index search schemes with keyword-wise encryption, while enjoying the same level of security. The proposed schemes ESS-KIS support 'like query ('ab%')' and a query with misprints. That is, this paper has the meaning of making the infeasible encrypted similarity searches into feasibility.

Online publication date: Wed, 16-Nov-2016

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 Internet Technology and Secured Transactions (IJITST):
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