4.7 Article

Privacy-preserving searchable encryption in the intelligent edge computing

Journal

COMPUTER COMMUNICATIONS
Volume 164, Issue -, Pages 31-41

Publisher

ELSEVIER
DOI: 10.1016/j.comcom.2020.09.012

Keywords

Privacy protecting; Searchable encryption; Multi-keyword fuzzy search; Secure k-nearest neighbor; S-HashMap; Dynamic

Funding

  1. National Key R&D Program of China [2017YFB0802300]
  2. National Natural Science Foundation of China [61772403, U1836203]
  3. Natural Science Foundation of Shaanxi Province, China [2019ZDLGY12-02]
  4. Shaanxi Innovation Team Project, China [2018TD-007]
  5. Xi'an Science and technology innovation plan, China [201809168CX9JC10]
  6. National 111 Program of China [B16037]

Ask authors/readers for more resources

In intelligent edge computing, the private data of users are partly or entirely outsourced to the intelligent edge nodes for processing. To enforce security and privacy on edge network, data owners encrypt their private data and outsource it. It is particularly important to carry out efficient search and update on encrypted data. In this paper, we propose a searchable scheme to solve these problems on the intelligent edge network. Specially, we first propose S-HashMap index structure to make data update efficiently and safely while promising multi-keyword fuzzy ciphertext retrieval. Secondly, to measure the similarity between the query vector and the index nodes, we utilize the secure k-nearest neighbor to calculate the Euclidean distance. In addition to eliminating the necessity of pre-defined dictionaries, we achieve efficient multi-keyword fuzzy search and index updating without increasing search complexity. At the same time, this paper makes a thorough theoretical analysis and simulation of the proposed scheme. Compared with other schemes, we demonstrate that our scheme has better security and efficiency.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available