Inverted Index Based Ranked Keyword Search in Multi-user Searchable Encryption

2019 ◽  
pp. 554-562
Author(s):  
Manju S. Nair ◽  
M. S. Rajasree
Keyword(s):  
Keyword Search ◽  
Searchable Encryption ◽  
Inverted Index ◽  
Ranked Keyword Search

PIMRS: achieving privacy and integrity-preserving multi-owner ranked-keyword search over encrypted cloud data

2016 ◽  
Vol 9 (16) ◽  
pp. 3765-3776 ◽  
Author(s):  
Jinguo Li ◽  
Mi Wen ◽  
Kejie Lu ◽  
Chunhua Gu
Keyword(s):  
Keyword Search ◽  
Cloud Data ◽  
Ranked Keyword Search

scholarly journals R-OO-KASE: Revocable Online/Offline Key Aggregate Searchable Encryption

2020 ◽  
Vol 5 (4) ◽  
pp. 391-418
Author(s):  
Mukti Padhya ◽  
Devesh C. Jinwala
Keyword(s):  
Radio Frequency Identification ◽  
Keyword Search ◽  
Electrical Power ◽  
Computational Cost ◽  
Security Analysis ◽  
Searchable Encryption ◽  
Resource Constrained ◽  
Encryption Decryption ◽  
Resource Constrained Devices ◽  
Constrained Devices

Abstract The existing Key Aggregate Searchable Encryption (KASE) schemes allow searches on the encrypted dataset using a single query trapdoor, with a feature to delegate the search rights of multiple files using a constant size key. However, the operations required to generate the ciphertext and decrypt it in these schemes incur higher computational costs, due to the computationally expensive pairing operations in encryption/decryption. This makes the use of such schemes in resource-constrained devices, such as Radio Frequency Identification Devices, Wireless Sensor Network nodes, Internet of Things nodes, infeasible. Motivated with the goal to reduce the computational cost, in this paper, we propose a Revocable Online/Offline KASE (R-OO-KASE) scheme, based on the idea of splitting the encryption/decryption operations into two distinct phases: online and offline. The offline phase computes the majority of costly operations when the device is on an electrical power source. The online phase generates final output with the minimal computational cost when the message (or ciphertext) and keywords become known. In addition, the proposed scheme R-OO-KASE also offers multi-keyword search capability and allows the data owners to revoke the delegated rights at any point in time, the two features are not supported in the existing schemes. The security analysis and empirical evaluations show that the proposed scheme is efficient to use in resource-constrained devices and provably secure as compared to the existing KASE schemes.

Multi-Keyword Searchable Encryption for E-Health System With Multiple Data Writers and Readers

2022 ◽  
pp. 107-131
Author(s):  
Dhruti P. Sharma ◽  
Devesh C. Jinwala
Keyword(s):  
Health System ◽  
Keyword Search ◽  
Medical Data ◽  
Searchable Encryption ◽  
Multiple Stakeholders ◽  
Computational Overhead ◽  
Multiple Data ◽  
Data Owner ◽  
Share Data ◽  
Conjunctive Search

E-health is a cloud-based system to store and share medical data with the stakeholders. From a security perspective, the stored data are in encrypted form that could further be searched by the stakeholders through searchable encryption (SE). Practically, an e-health system with support of multiple stakeholders (that may work as either data owner [writer] or user [reader]) along with the provision of multi-keyword search is desirable. However, the existing SE schemes either support multi-keyword search in multi-reader setting or offer multi-writer, multi-reader mechanism along with single-keyword search only. This chapter proposes a multi-keyword SE for an e-health system in multi-writer multi-reader setting. With this scheme, any registered writer could share data with any registered reader with optimal storage-computational overhead on writer. The proposed scheme offers conjunctive search with optimal search complexity at server. It also ensures security to medical records and privacy of keywords. The theoretical and empirical analysis demonstrates the effectiveness of the proposed work.

Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data

2012 ◽  
Vol 23 (8) ◽  
pp. 1467-1479 ◽  
Author(s):  
Cong Wang ◽  
Ning Cao ◽  
Kui Ren ◽  
Wenjing Lou
Keyword(s):  
Keyword Search ◽  
Cloud Data ◽  
Ranked Keyword Search

An Efficient Privacy-Preserving Ranked Keyword Search Method

2016 ◽  
Vol 27 (4) ◽  
pp. 951-963 ◽  
Author(s):  
Chi Chen ◽  
Xiaojie Zhu ◽  
Peisong Shen ◽  
Jiankun Hu ◽  
Song Guo ◽  
...  
Keyword(s):  
Keyword Search ◽  
Privacy Preserving ◽  
Search Method ◽  
Ranked Keyword Search
Sign in / Sign up

Export Citation Format

Share Document