PKIS: practical keyword index search on cloud datacenter

Abstract

This paper highlights the importance of the interoperability of the encrypted DB in terms of the characteristics of DB and efficient schemes. Although most prior researches have developed efficient algorithms under the provable security, they do not focus on the interoperability of the encrypted DB. In order to address this lack of practical aspects, we conduct two practical approaches-efficiency and group search in cloud datacenter. The process of this paper is as follows: first, we create two schemes of efficiency and group search-practical keyword index search-I and II; second, we define and analyze group search secrecy and keyword index search privacy in our schemes; third, we experiment on efficient performances over our proposed encrypted DB. As the result, we summarize two major results: (1)our proposed schemes can support a secure group search without re-encrypting all documents under the group-key update and (2)our experiments represent that our scheme is approximately 935 times faster than Golle's scheme and about 16 times faster than Song's scheme for 10,000 documents. Based on our experiments and results, this paper has the following contributions: (1) in the current cloud computing environments, our schemes provide practical, realistic, and secure solutions over the encrypted DB and (2) this paper identifies the importance of interoperability with database management system for designing efficient schemes.

Secure Information Sharing System for Online Patient Networks

“…(2.3) Reversed Hash Chain: SISS should guarantee forward secrecy and backward accessibility, along with group key secrecy [5], which are security requirements in group information sharing system. In SISS, every member's group key is generated based on reversed one-way hash chain.…”

“…They accomplished both security properties with reversed hash key chain. Thereafter, they made the formal definition for 'backward accessibility' firstly in [5], where they proposed two practical group search schemes in the respect of efficiency in cloud datacenter. As for the researches not based on reversed hash key chain, Wang et.…”

“…→ such that for any ∈ , there exists ∈ , such that ( ) < 1/ for all ≥ [5]. The model SISS satisfies group information sharing secrecy as follows: (1) forward secrecy, (2) backward accessibility, (3) group key secrecy, and 4 Proof.…”

A Proxy-Based Data Security Solution in Mobile Cloud

“…There are many data security risks [1] in cloud. For this problem, many security technologies are proposed, such as the searchable encryption [2,3], data deletion proving [4,5], provable data possession [6,7] and trusted computing [8]. However, there is the performance limitation issue of mobile client when performing above technologies, affecting on user experience.…”

Searchable encryption: A survey on privacy‐preserving search schemes on encrypted outsourced data

“…Number of studies referring to the proposed taxonomy-type of result Boolean results19,[37][38][39][40]44,45,[50][51][52]63,68,71,74,75,89,95,101,106,111,114,115,[120][121][122][123]125,[127][128][129]140,154,187 2.Ranked results[12][13][14]16,[27][28][29]35,36,43,46,49,53,[55][56][57][58][59][60]…”