Cryptology ePrint Archive: Report 2018/052

Optimizing Trees for Static Searchable Encryption

Mohammad Etemad and Mohammad Mahmoody and David Evans

Abstract: Searchable symmetric encryption (SSE) enables data owners to conduct searches over encrypted data stored by an untrusted server, retrieving only those encrypted files that match the search queries. Several recent schemes employ a server-side encrypted index in the form of a search tree where each node stores a bit vector denoting for each keyword whether any file in its subtree contains that keyword. Our work is motivated by the observation that the way data is distributed in such a search tree has a big impact on the cost of searches. For single-keyword queries, it impacts the number of different paths that must be followed to find all the matching files; for multi-keyword queries, the arrangement of the tree also impacts the number of nodes visited during the search on paths that do not lead to any satisfying data elements. We present three algorithms that improve the performance of SSE schemes based on tree indexes and prove that for cases where the search cost is high, the cost of our algorithms converges to the cost of the optimal tree. In our experiments, the resulting search trees outperform the arbitrary search trees used in previous works by a factor of up to two

Category / Keywords: applications /

Date: received 9 Jan 2018

Contact author: etemad at virginia edu

Available format(s): PDF | BibTeX Citation

Version: 20180115:003152 (All versions of this report)

Short URL: ia.cr/2018/052


[ Cryptology ePrint archive ]