A Parallel Multi-keyword Top-k Search Scheme over Encrypted Cloud Data - Network and Parallel Computing Access content directly
Conference Papers Year : 2019

A Parallel Multi-keyword Top-k Search Scheme over Encrypted Cloud Data

Abstract

With searchable encryptions in the cloud computing, users can outsource their sensitive data in ciphertext to the cloud that provides efficient and privacy-preserving multi-keyword top-k searches. However, most existing top-k search schemes over encrypted cloud data are the centralize schemes which are limited in large scale data environment. To support scalable searches, we propose a parallel multi-keyword top-k search scheme over encrypted cloud data. In this scheme, the fragment-based encrypted inverted index is designed, which is indistinguishable and can be used for parallel searching. On the basis of such indexes, a Map-Reduce-based distributed computing framework is adopted to implement the parallel multi-keyword top-k search algorithms. Security analysis and experiment evaluation show that the proposed scheme is privacy-preserving, efficient and scalable.
Fichier principal
Vignette du fichier
486810_1_En_14_Chapter.pdf (4.27 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03770532 , version 1 (06-09-2022)

Licence

Attribution

Identifiers

Cite

Maohu Yang, Hua Dai, Jingjing Bao, Xun Yi, Geng Yang. A Parallel Multi-keyword Top-k Search Scheme over Encrypted Cloud Data. 16th IFIP International Conference on Network and Parallel Computing (NPC), Aug 2019, Hohhot, China. pp.169-181, ⟨10.1007/978-3-030-30709-7_14⟩. ⟨hal-03770532⟩
8 View
19 Download

Altmetric

Share

Gmail Facebook X LinkedIn More