Privacy preserving substring search protocol with polylogarithmic communication cost

Efficient Oblivious Substring Search via Architectural Support

“…These attacks pushed for the availability of efficient PPSS protocols avoiding this information leakage. In many of the existing solutions [22,27,42,48] the low leakage comes at the cost of making the computation cost on server side linear in the document collection size. The PPSS protocol described in [30] allows to reduce such cost to polylogarithmic; however, it requires O(m+o q ) communication rounds and a polylogarithmic bandwidth cost.…”

“…We provide an operative description of the backward search algorithm in Alg. 1, pointing the reader interested in the detailed correctness analysis to [14,27]. Backward Search in a Document Collection.…”

Achieving Efficient and Privacy-Preserving Multi-Keyword Conjunctive Query Over Cloud

“…However, its query time is relatively large. Later, Mainardi et al [22] optimizes the query algorithm in [20] to achieve (| | + ) at the cost of higher index space, i.e., (|Σ|⋅ ), where |Σ| is the number of distinct characters in the dictionary. Although authors in this article considered datasets with small |Σ| (e.g., DNA dataset), the |Σ| can be large in practice.…”

“…In contrast, [20] utilizes Burrows-Wheeler Transformation (BWT) to build a suffix array index to support substring query, which has better storage-efficiency than the suffix tree at the cost of worse query-efficiency. Later, based on the scheme in [20] , [22] uses Private Information Retrieval (PIR) technique to protect the access pattern, which causes high index space and query time. In addition to suffix tree and suffix array, there are other auxiliary data structures [15,23] can be used to support substring query.…”

“…Unfortunately, most SSE schemes with the current keyword-based index techniques cannot be directly used to support the substring-of-keyword query because their indexes do not contain the substring information. Although some SSE schemes [7,20,22,15] focus on the substring query and can be used to implement substring-ofkeyword query, they cannot achieve high efficiency in terms of the computational cost of query processing and the overhead of storage at the same time.…”