作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2025, Vol. 51 ›› Issue (4): 188-197. doi: 10.19678/j.issn.1000-3428.0069084

• 网络空间安全 • 上一篇    下一篇

基于全同态加密的可验证多关键词密文检索方案

唐莹莹, 陈玉玲*(), 罗运, 李再东   

  1. 贵州大学省部共建公共大数据国家重点实验室计算机科学与技术学院, 贵州 贵阳 550025
  • 收稿日期:2023-12-22 出版日期:2025-04-15 发布日期:2024-05-10
  • 通讯作者: 陈玉玲
  • 基金资助:
    国家自然科学基金(62202118); 贵州省教育厅“揭榜挂帅”科技攻关项目(黔教技003号); 贵州省科技厅百层次创新人才项目(黔科合平台人才-GCC018); 贵州省教育厅自然科学研究科技拔尖人才项目(黔教技073号)

Verifiable Multi-Keyword Ciphertext Retrieval Scheme Based on Fully Homomorphic Encryption

TANG Yingying, CHEN Yuling*(), LUO Yun, LI Zaidong   

  1. College of Computer Science and Technology, State Key Laboratory of Public Big Data, Co-built by Province and Ministry, Guizhou University, Guiyang 550025, Guizhou, China
  • Received:2023-12-22 Online:2025-04-15 Published:2024-05-10
  • Contact: CHEN Yuling

摘要:

由于云服务器能够提供强大的存储和计算能力, 因此个人和企业更趋向于将加密数据存储于云端。为了解决密文数据检索困难的问题, 利用同态加密的密文检索方式成为研究热点。然而, 现有的方案主要集中在单关键词检索上, 由于检索限制条件较少、搜索精度较低, 从而导致通信和计算开销较大。另外, 将数据托管到第三方提供的不可信云主机上, 可能出现删除、修改、返回不真实和不全面的搜索信息等恶意情况。为此, 基于全同态加密和不经意伪随机函数提出一种新型的密文检索方案。通过构造加密的关键词索引和哈希表, 使得方案能够支持多关键词的连接查询。利用文件的标识和大小生成验证标签, 使得数据接收者能够对检索结果的正确性和完整性进行验证。理论分析和实验结果表明, 相比于基于全同态加密的单关键词检索方案, 在检索2~3个多关键词时, 所提方案的密文搜索效率提升36.2%~45.9%, 并且在检索更多关键词时拥有更好的综合性能。

关键词: 云存储, 全同态加密, 密文检索, 安全共享, 可验证

Abstract:

Individuals and businesses are more inclined to store encrypted data in the cloud because cloud servers offer powerful storage and computing capabilities. Ciphertext retrieval using homomorphic encryption has become a research hotspot to address the issue of difficult ciphertext data retrieval. However, existing schemes mainly focus on single-keyword retrieval, which results in high communication and computation overheads owing to fewer retrieval constraints and lower search accuracy. In addition, owing to the hosting of data on untrustworthy cloud hosts provided by third parties, malicious situations such as the deletion, modification, or return of untrue and incomplete search information may occur. Therefore, a novel ciphertext retrieval scheme is proposed based on full homomorphic encryption and an inadvertent pseudo-random function. By constructing an encrypted keyword index and hash table, the scheme can support multi-keyword conjunctive retrieval. The identification and size of the file are used to generate authentication tags that enable the data receiver to verify the correctness and integrity of the retrieval results. Theoretical analysis and experimental results show that, compared to the single-keyword retrieval scheme based on full homomorphic encryption, the efficiency of searching ciphertexts is improved by 36.2%-45.9% when retrieving 2-3 multiple keywords, and the proposed scheme exhibits better overall performance when retrieving more keywords.

Key words: cloud storage, fully homomorphic encryption, ciphertext retrieval, secure sharing, verifiable