Authors: Hyun-A Park
Addresses: Department of Medical Health Sciences, KyungDong University, 815 Gyeonhwon-ro, MunMak-eub, WonJu, Kangwon-do, South Korea
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.
Keywords: keyword index search; encrypted data; similarity search; character-wise encryption; approximate string matching; hamming distance; cryptography; search privacy; search security.
International Journal of Internet Technology and Secured Transactions, 2016 Vol.6 No.3, pp.231 - 257
Available online: 16 Nov 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article