Variable-Length Indistinguishable Binary Tree for Keyword Searching Over Encrypted Data
Lists
Only you see this
Abstract
We consider the problem of privacy-preserving keyword search on the clouds. In this paper, we propose a new searchable encryption scheme that satisfies efficient and secure query processing. In particular, our scheme utilizes a novel data structure called Indistinguishable Bloom Filter (IBF) to construct the first variable-length Indistinguishable Binary Tree (vIBtree). Prior IBF based searchable encryption scheme takes tremendous time to construct a huge secure index. Our scheme overcomes these two shortcomings by constructing an inconsiderable secure index within an insignificant time. Meanwhile, we propose a corresponding trapdoor algorithm for vIBtree. Furthermore, we analyze that our scheme is secure under the adaptive \(IND-CKA\) security model. We implemented our scheme in C language. Our experiments show that vIBtree can speedup the secure index construction time and reduce the storage overhead for the data structure over known, state of the art alternatives.
BibTeX
@inproceedings{wang2020variable,
author = {Heyu Wang and Qin Jiang and Hui He and Yong Qi and Xu Yang},
title = {{Variable-Length Indistinguishable Binary Tree for Keyword Searching Over Encrypted Data}},
booktitle = {WISA},
year = {2020},
url = {https://openreview.net/forum?id=m8K4w7P4aL},
}Loading related content...