期刊
出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3201595.3201598
关键词
substring searchable encryption; suffix array; secure outsourced storage; compression index; privacy
We address the problem of substring searchable encryption. A single user produces a big stream of data and later on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures to achieve efficient substring search on the server side, the cost at the user side may be prohibitive. We revisit the work of substring searchable encryption in order to reduce the storage cost of auxiliary data structures. Our solution entails a suffix array based index design, which allows optimal storage cost O(n) with small hidden factor at the size of the string n. Moreover, we implemented our scheme and the state of the art protocol [ 7] to demonstrate the performance advantage of our solution with precise benchmark results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据