论文标题
与小客户端存储的非交互性多客户可搜索的对称加密
Non-interactive Multi-client Searchable Symmetric Encryption with Small Client Storage
论文作者
论文摘要
对动态可搜索的对称加密(DSSE)非常关注,该加密允许用户在动态更新的加密数据库上搜索。为了提高现实世界应用程序的性能,最新的非交互性多客户DSSE方案的目标是避免数据所有者和数据用户之间的各种互动。但是,现有的非交互性多客户DSSE计划不考虑向前的隐私或向后隐私,使其暴露于泄漏滥用攻击。此外,大多数现有的具有向前和向后隐私的DSSE计划都依赖于保留关键字操作计数器或倒置索引,从而导致数据所有者方面的沉重存储负担。为了解决这些问题,我们建议使用小客户存储的非交互性多客户DSSE计划,我们提出的计划可以提供远期隐私和向后隐私。具体而言,我们首先设计了一个轻巧的存储链结构,该结构将所有关键字绑定到单个状态以降低存储成本。然后,我们提出了一种隐藏的密钥技术,该技术可以通过时间范围查询保留非相互作用的远期隐私,从而确保具有较新的时间戳的数据不能匹配较早的时间范围。我们进行广泛的实验来验证我们的方法,以证明计算效率。此外,安全分析证明了我们方法的隐私权属性。
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.