Substring Position Search over Encrypted Cloud Data Using Tree-Based Index

Strizhov, Mikhail; Ray, Indrajit

doi:10.1109/ic2e.2015.33

Cited by 9 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this method generates a huge index because there are O(n 2 ) substrings in a document of length n. Reducing the size of an index is an important problem. Toward solving this problem, several substring searchable symmetric encryption schemes have been proposed [7], [10], [14], [19], [26], [29].…”

Section: Backgroundsmentioning

confidence: 99%

See 1 more Smart Citation

Substring Searchable Symmetric Encryption Based on an Improved DAWG

Yamamoto

ODA

WACHI³

et al. 2022

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

A searchable symmetric encryption (SSE) scheme is a method that searches encrypted data without decrypting it. In this paper, we address the substring search problem such that for a set D of documents and a pattern p, we find all occurrences of p in D. Here, a document and a pattern are defined as a string. A directed acyclic word graph (DAWG), which is a deterministic finite automaton, is known for solving a substring search problem on a plaintext. We improve a DAWG so that all transitions of a DAWG have distinct symbols. Besides, we present a space-efficient and secure substring SSE scheme using an improved DAWG. The proposed substring SSE scheme consists of an index with a simple structure, and the size is O(n) for the total size n of documents.

show abstract

Section: Backgroundsmentioning

confidence: 99%

“…Several substring SSE schemes have been proposed [7], [10], [14], [19], [26], [29]. To the best of our knowledge, the existing substring SSE schemes can be classified into two types.…”

Section: Related Workmentioning

confidence: 99%

Substring Searchable Symmetric Encryption Based on an Improved DAWG

Yamamoto

ODA

WACHI³

et al. 2022

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

show abstract

“…As the disclosure of such information from the DNA may reveal personal information, the data are encrypted, thus requiring a secure search over these data. 261 proposed an SE scheme supporting substring position search using a position heap tree, 262 where the DO generates the encrypted position tree and the CS performs an encrypted search over this encrypted tree. The problem is explored by various researchers [263][264][265][266][267][268] in the literature.…”

Section: Support For Regular Expression Queriesmentioning

confidence: 99%

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

Handa

Krishna

Aggarwal

2019

Concurrency and Computation

View full text Add to dashboard Cite

Outsourcing confidential data to cloud storage leads to privacy challenges that can be reduced using encryption. However, with encryption in place, the utilization of the data is reduced, which leads to reduced quality of experience of the users. To overcome this, searchable encryption (SE) schemes are utilized, which allow the end users to retrieve the relevant documents from the cloud, for which various researchers have worked utilizing different techniques. Despite the popularity of the searchable encryption schemes, most of the surveys either do not provide or present an incomplete taxonomy of SE schemes. Hence, in this paper, we attempt to present a complete taxonomy/classification of the searchable encryption schemes in terms of the type of search, type of index, results retrieved, implementation type, multiplicity of users, and the technique used. From the literature, it is observed that inner product similarity is widely adopted by researchers to compute the similarity of the query and the document index as it provides both conjunctive and disjunctive searching (ie, have better search capability) but requires high search time (ie, have lower search efficiency). On the other hand, schemes based on binary comparisons exist, which require less search time (ie, have better search efficiency) but support only conjunctive searching (ie, have limited search capability). Thus, a major conclusion drawn from our work is that there is an imbalance between search capability and search efficiency, ie, in the existing schemes, search capability can be improved at the cost of search time only. Therefore, we suggest that one direction where researchers should work on is to provide a balance between search capability and search efficiency.

show abstract

“…This leads to increased communication overheads as irrelevant documents are downloaded by the end‐users. Index‐based searching in employed by various researchers either using forward index, inverted index, and tree‐based index …”

Section: Related Workmentioning

confidence: 99%

“…Index-based searching in employed by various researchers either using forward index, ‡ inverted index, § and tree-based index. 16,41,[64][65][66][67] Ranked Retrieval -To provide ranked results based on relevance of the search query, the introductory work was proposed by Wang et al 7 based on Order-preserving encryption. 68 This scheme was able to rank the results but was applicable to single keyword only.…”

Section: Related Workmentioning

confidence: 99%

Document clustering for efficient and secure information retrieval from cloud

Handa

Krishna

Aggarwal

2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary Organizations prefer using cloud for storing their data due to availability of cost‐effective storage. The outsourced data include sensitive information, so data is encrypted as maintaining confidentiality and privacy of the documents is of paramount importance. Retrieving the desired information from the cloud requires efficient searching, which involves submission of search query to the cloud server by the end‐user. As the search terms may include sensitive information of an organization, it is desired that the search query should not reveal any confidential information. The existing works are not suitable for big‐data scenario due to high search time required for large document collections, thereby leading to increased cloud usage cost. Thus, an efficient approach to perform search on encrypted data using clustering is proposed in this paper. As the proposed technique clusters the documents based on the relationship between the keywords, the search method involves searching documents within the relevant cluster in contrast to searching the entire dataset. An efficient ranking method is incorporated to rank the documents according to the relevance to search query using Term Frequency‐Inverse Document Frequency (tf‐idf) value of the keywords in the documents, which leads to reduced communication overheads due to reduction in unnecessary documents being downloaded. Moreover, an efficient query randomization approach is proposed so that two or more queries involving the same search terms appear distinct. Experimental results using real datasets demonstrate that our proposed multi‐keyword ranked search scheme on encrypted cloud data significantly reduce the number of comparisons and search time in comparison to the existing techniques while maintaining recall of 100% and precision of 82%.

show abstract

Substring Position Search over Encrypted Cloud Data Using Tree-Based Index

Cited by 9 publications

References 23 publications

Substring Searchable Symmetric Encryption Based on an Improved DAWG

Substring Searchable Symmetric Encryption Based on an Improved DAWG

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

Document clustering for efficient and secure information retrieval from cloud

Contact Info

Product

Resources

About