VKSE-DO: verifiable keyword search over encrypted data for dynamic data-owner

Author(s):  
Yinbin Miao ◽  
Jianfeng Ma ◽  
Fushan Wei ◽  
Kai Zhang ◽  
Zhiquan Liu
Author(s):  
Zhiquan Liu ◽  
Yinbin Miao ◽  
Jianfeng Ma ◽  
Fushan Wei ◽  
Kai Zhang

2016 ◽  
Vol 11 (2) ◽  
pp. 287-297 ◽  
Author(s):  
Yinbin Miao ◽  
Jianfeng Ma ◽  
Ximeng Liu ◽  
Zhiquan Liu ◽  
Limin Shen ◽  
...  

Author(s):  
Tong Liu ◽  
Yinbin Miao ◽  
Kim-Kwang Raymond Choo ◽  
Hongwei Li ◽  
Ximeng Liu ◽  
...  

2022 ◽  
pp. 107-131
Author(s):  
Dhruti P. Sharma ◽  
Devesh C. Jinwala

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.


2013 ◽  
Vol 10 (2) ◽  
pp. 667-684 ◽  
Author(s):  
Jianfeng Wang ◽  
Hua Ma ◽  
Qiang Tang ◽  
Jin Li ◽  
Hui Zhu ◽  
...  

As cloud computing becomes prevalent, more and more sensitive data is being centralized into the cloud by users. To maintain the confidentiality of sensitive user data against untrusted servers, the data should be encrypted before they are uploaded. However, this raises a new challenge for performing search over the encrypted data efficiently. Although the existing searchable encryption schemes allow a user to search the encrypted data with confidentiality, these solutions cannot support the verifiability of searching result. We argue that a cloud server may be selfish in order to save its computation ability or bandwidth. For example, it may execute only a fraction of the search and returns part of the searching result. In this paper, we propose a new verifiable fuzzy keyword search scheme based on the symbol-tree which not only supports the fuzzy keyword search, but also enjoys the verifiability of the searching result. Through rigorous security and efficiency analysis, we show that our proposed scheme is secure under the proposed model, while correctly and efficiently realizing the verifiable fuzzy keyword search. The extensive experimental results demonstrate the efficiency of the proposed scheme.


Sign in / Sign up

Export Citation Format

Share Document