Four-branch tree: highly efficient Boolean queries over encrypted cloud data
Lists
Only you see this
Abstract
This work aims to design highly efficient searchable encryption (SE) schemes to process Boolean queries over outsourced data files on untrusted public clouds while preserving users’ privacy. Many tree-based SE schemes support sub-linear conjunctive queries. However, all the trees suffer from a logarithmic multiplicative overhead in each search process. To make the tree work as efficiently as possible, we present a novel tree data structure called four-branch tree (FBTree). Our core design is to make a tree node have four branches, which help the searching process to access the desired tree nodes quickly. FBTree acts as an efficient inverted index, but it is still a tree data structure. Based on this, two schemes are provided for different usage scenarios: one achieves nearly-optimal search complexity and strong adaptive security for the efficiency-first environment, and the other is a sub-linear Boolean-query scheme via Oblivious RAM for security-first settings. Several real datasets are used to evaluate FBTree performance. Testing results demonstrate that the FBTree structure has high efficiency and scalability for encrypted Boolean searches
BibTeX
@inproceedings{wu2019four,
author = {Zhiqiang Wu and Kenli Li and Jin Wang},
title = {{Four-branch tree: highly efficient Boolean queries over encrypted cloud data}},
booktitle = {IEEE Access},
year = {2019},
doi = {10.1109/access.2019.2923751},
}Loading related content...