Table of Content

Open Access iconOpen Access

ARTICLE

crossmark

Paillier-Based Fuzzy Multi-Keyword Searchable Encryption Scheme with Order-Preserving

Xiehua Li1,*, Fang Li1, Jie Jiang1, Xiaoyu Mei2

1 School of Computer Science and Electronic Engineering, Hunan University, Changsha, 410082, China.
2 New Lynn School, Auckland, 0600, New Zealand.

* Corresponding Author: Xiehua Li. Email: email.

Computers, Materials & Continua 2020, 65(2), 1707-1721. https://doi.org/10.32604/cmc.2020.011227

Abstract

Efficient multi-keyword fuzzy search over encrypted data is a desirable technology for data outsourcing in cloud storage. However, the current searchable encryption solutions still have deficiencies in search efficiency, accuracy and multiple data owner support. In this paper, we propose an encrypted data searching scheme that can support multiple keywords fuzzy search with order preserving (PMS). First, a new spelling correction algorithm-(Possibility-Levenshtein based Spelling Correction) is proposed to correct user input errors, so that fuzzy keywords input can be supported. Second, Paillier encryption is introduced to calculate encrypted relevance score of multiple keywords for order preserving. Then, a queue-based query method is also applied in this scheme to break the linkability between the query keywords and search results and protect the access pattern. Our proposed scheme achieves fuzzy matching without expanding the index table or sacrificing computational efficiency. The theoretical analysis and experiment results show that our scheme is secure, accurate, error-tolerant and very efficient.

Keywords


Cite This Article

X. Li, F. Li, J. Jiang and X. Mei, "Paillier-based fuzzy multi-keyword searchable encryption scheme with order-preserving," Computers, Materials & Continua, vol. 65, no.2, pp. 1707–1721, 2020.

Citations




cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2004

    View

  • 1135

    Download

  • 0

    Like

Share Link