Searchable Symmetric Encryption with Forward Search Privacy
Searchable Symmetric Encryption with Forward Search Privacy
复制标题
具有前向搜索隐私的可搜索对称加密
DOI：
10.1109/tdsc.2019.2894411
复制
发表时间：
2021-01-01
影响因子：
7.3
通讯作者：
Lou, Wenjing
中科院分区：
文献类型：
--
作者：
Li, Jin;Huang, Yanyu;Lou, Wenjing
可搜索对称加密（SSE）在实际的加密数据库查询中得到了广泛的应用。虽然SSE功能强大且功能丰富，但它总是受到信息泄漏的困扰。最近的一些攻击指出，前向隐私，不允许从更新操作泄漏，现在成为任何新设计的SSE计划的基本要求。然而，随后的搜索操作仍然可能泄漏大量信息。为了进一步加强安全性，我们扩展了前向隐私的定义，提出了“前向搜索隐私”的概念。直观地说，它要求对新添加的文档进行搜索操作，而不会泄漏有关过去查询的任何信息。增强的安全概念对SSE的设计提出了新的挑战。我们通过开发隐藏指针技术（HPT）来解决这些挑战，并提出了一个新的SSE方案，称为Khons，它满足我们的安全概念（与原始的前向隐私概念），也是有效的。我们实现了Khons，我们在大数据集（维基百科）上的实验结果表明，它比现有的SSE方案具有前向隐私更有效。
Searchable symmetric encryption (SSE) has been widely applied in the encrypted database for queries in practice. Although SSE is powerful and feature-rich, it is always plagued by information leaks. Some recent attacks point out that forward privacy which disallows leakage from update operations, now becomes a basic requirement for any newly designed SSE schemes. However, the subsequent search operations can still leak a significant amount of information. To further strengthen security, we extend the definition of forward privacy and propose the notion of “forward search privacy”. Intuitively, it requires search operations over newly added documents do not leak any information about past queries. The enhanced security notion poses new challenges to the design of SSE. We address the challenges by developing the hidden pointer technique (HPT) and propose a new SSE scheme called Khons, which satisfies our security notion (with the original forward privacy notion) and is also efficient. We implemented Khons and our experiment results on large dataset (wikipedia) show that it is more efficient than existing SSE schemes with forward privacy.