Considerable attention has been paid to dynamic searchable symmetric encryption (DSSE) which allows users to search on dynamically updated encrypted databases. To improve the performance of real-world applications, recent non-interactive multi-client DSSE schemes are targeted at avoiding per-query interaction between data owners and data users. However, existing non-interactive multi-client DSSE schemes do not consider forward privacy or backward privacy, making them exposed to leakage abuse attacks. Besides, most existing DSSE schemes with forward and backward privacy rely on keeping a keyword operation counter or an inverted index, resulting in a heavy storage burden on the data owner side. To address these issues, we propose a non-interactive multi-client DSSE scheme with small client storage, and our proposed scheme can provide both forward privacy and backward privacy. Specifically, we first design a lightweight storage chain structure that binds all keywords to a single state to reduce the storage cost. Then, we present a Hidden Key technique, which preserves non-interactive forward privacy through time range queries, ensuring that data with newer timestamps cannot match earlier time ranges. We conduct extensive experiments to validate our methods, which demonstrate computational efficiency. Moreover, security analysis proves the privacy-preserving property of our methods.
翻译:已相当重视动态可搜索的对称加密(DSSE),使用户能够对动态更新的加密数据库进行搜索。为了改进真实世界应用程序的性能,最近的非互动多客户DSSE计划旨在避免数据所有者和数据用户之间的逐个互动。然而,现有的非互动多客户DSSE计划并不考虑前方隐私或后方隐私,使他们面临渗漏滥用攻击的风险。此外,大多数具有前方和后方隐私的现有DSSE计划依赖于保留关键词操作柜台或反向索引,从而给数据所有者造成沉重的存储负担。为了解决这些问题,我们提议了一个非互动的多客户DSSE计划,我们提议的计划可以提供前方隐私和后方隐私。具体地说,我们首先设计一个轻量的存储链结构,将所有关键词与单个国家捆绑在一起,以减少存储成本。然后,我们提出了一个隐藏的关键技术,通过时间范围查询来保持非互动的前方隐私,确保带有新时间戳的数据无法与早期的时间范围相匹配。我们要提出一个非互动的多用户的多用户DSSE计划,我们提出的计划可以提供广泛的保密性分析。我们的安全性方法。我们进行广泛的测试。