网络与信息安全学报 ›› 2023, Vol. 9 ›› Issue (2): 143-153.doi: 10.11959/j.issn.2096-109x.2023028

• 学术论文 • 上一篇    下一篇

多关键词动态可搜索加密方案

袁承昊1, 李勇1, 任爽2   

  1. 1 北京交通大学电子信息工程学院,北京 100044
    2 北京交通大学计算机与信息技术学院,北京 100044
  • 修回日期:2023-02-19 出版日期:2023-04-25 发布日期:2023-04-01
  • 作者简介:袁承昊(1998- ),男,山东东营人,北京交通大学硕士生,主要研究方向为云计算安全
    李勇(1973- ),男,山东无棣人,北京交通大学副教授,主要研究方向为数据安全与隐私保护、区块链安全
    任爽(1981- ),男,吉林长春人,北京交通大学副教授,主要研究方向为人工智能、区块链、虚拟现实技术
  • 基金资助:
    国家自然科学基金(62072025);2020年工业互联网创新发展工程项目(TC200H01V)

Dynamic multi-keyword searchable encryption scheme

Chenghao YUAN1, Yong LI1, Shuang REN2   

  1. 1 School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
    2 School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
  • Revised:2023-02-19 Online:2023-04-25 Published:2023-04-01
  • Supported by:
    The National Natural Science Foundation of China(62072025);2020 Innovative Development Project of the Industrial Internet(TC200H01V)

摘要:

云存储用户将数据外包存储至云服务器以节省本地存储资源。然而,云存储数据脱离了用户的物理控制范围,可导致云端隐私数据被恶意窃取或泄露。目前动态可搜索加密方案多以对称可搜索加密为主,需要预先建立安全的密钥共享信道,难以直接应用于云存储数据共享场景。针对云存储多方数据的安全共享场景,提出了一种多关键词动态可搜索加密方案。该方案通过引入布谷鸟过滤器构建正向索引,实现数据拥有者对文档及索引的动态添加和删除。同时结合双线性对与拉格朗日插值多项式,可支持多关键词的联合搜索。为降低密文检索阶段的计算开销,采用倒排索引与正向索引结合的构造,以提高云服务器的检索效率。基于判定线性 Diffie-Hellman 问题,在适应性选择关键词攻击下可证明方案的安全性。通过实验分析所提方案在不同数据集中进行关键词搜索及索引更新的执行效率,结果表明所提方案可有效避免检索时间与密文数量的线性相关性,降低了数据量较大情况下更新操作中的计算开销。

关键词: 可搜索加密, 云存储, 布谷鸟过滤器, 倒排索引

Abstract:

Users of cloud storage often outsource their data to cloud servers to save local storage resources.However, cloud storage data is out of the user’s physical control, which may lead to malicious theft or disclosure of private data on cloud.At present, dynamic searchable encryption schemes are mostly based on symmetric searchable encryption, which need to establish a secure key sharing channel in advance, and cannot be directly applied to data sharing in cloud storage scenarios.For the secure sharing scenario of multi-party data in cloud storage, a dynamic multi-keyword searchable encryption scheme was proposed.The forward index was constructed by a cuckoo filter to enable data owners to perform documents and index dynamic updates.The conjunctive multi-keywords search was supported by combining bilinear pairing with Lagrangian interpolation polynomials.To reduce the computational overhead in the ciphertext retrieval phase, a combination of inverted index and forward index was constructed to improve the retrieval efficiency of cloud server.This scheme is provably secure with the indistinguishability in adaptively chosen keyword attack under decision linear Diffie-Hellman problem.Simulation experiments were conducted to analyze the execution efficiency of the scheme for keyword search and index update in different datasets.The results show that the scheme effectively avoids the linear correlation between the retrieval time and the number of ciphertexts, and reduces the computational overhead in the update operation with a large amount of data.

Key words: searchable encryption, cloud storage, cuckoo filter, inverted index

中图分类号: 

No Suggested Reading articles found!