通信学报 ›› 2024, Vol. 45 ›› Issue (1): 94-105.doi: 10.11959/j.issn.1000-436x.2024002

• 学术论文 • 上一篇    

基于分层结构的匹配量隐藏加密多重映射方案

陈晶, 李瀚星, 何琨, 加梦, 李雨晴, 杜瑞颖   

  1. 武汉大学国家网络安全学院,湖北 武汉 430040
  • 修回日期:2023-10-19 出版日期:2024-01-01 发布日期:2024-01-01
  • 作者简介:陈晶(1981- ),男,湖北武汉人,博士,武汉大学教授、博士生导师,主要研究方向为网络安全、应用密码学、分布式系统安全等
    李瀚星(1999- ),男,天津人,武汉大学硕士生,主要研究方向为网络安全、应用密码学等
    何琨(1986- ),男,湖北武汉人,博士,武汉大学副教授、博士生导师,主要研究方向为应用密码学、网络安全、云计算安全、人工智能安全、区块链安全等
    加梦(1996- ),女,湖北随州人,武汉大学博士生,主要研究方向为区块链、应用密码学等
    李雨晴(1991- ),女,江苏徐州人,博士,武汉大学副研究员、硕士生导师,主要研究方向为隐私计算、分布式学习、网络安全等
    杜瑞颖(1964- ),女,河南新乡人,博士,武汉大学教授、博士生导师,主要研究方向为网络安全、隐私保护等
  • 基金资助:
    国家重点研发计划基金资助项目(2021YFB2700200);中央高校基本科研业务费专项资金资助项目(2042022kf1195);中央高校基本科研业务费专项资金资助项目(2042022kf0046);国家自然科学基金资助项目(62076187);国家自然科学基金资助项目(62172303);湖北省重点研发计划基金资助项目(2022BAA039);山东省重点研发计划基金资助项目(2022CXPT055)

Volume-hiding encrypted multi-map scheme based on hierarchical structure

Jing CHEN, Hanxing LI, Kun HE, Meng JIA, Yuqing LI, Ruiying DU   

  1. School of Cyber Science and Engineering, Wuhan University, Wuhan 430040, China
  • Revised:2023-10-19 Online:2024-01-01 Published:2024-01-01
  • Supported by:
    The National Key Research and Development Program of China(2021YFB2700200);The Fundamental Research Funds for the Central Universities(2042022kf1195);The Fundamental Research Funds for the Central Universities(2042022kf0046);The National Natural Science Foundation of China(62076187);The National Natural Science Foundation of China(62172303);The Key Research and Development Program of Hubei Province(2022BAA039);The Key Research and Development Program of Shandong Province(2022CXPT055)

摘要:

匹配量隐藏的加密多重映射(EMM)方案可以防止攻击者利用匹配量泄露推理搜索的明文,但是现有方案存在查询计算开销较大的问题。基于被检索数据的匹配量往往服从齐夫定律的特性,设计了一种分层结构的匹配量隐藏EMM方案。相对将全部键值匹配量填充至相等的朴素设计,所提方案将对整体数据的填充转为对多块子数据的填充,减少了存储开销,并实现了常数复杂度的查询开销。安全性分析表明,所提方案能够在查询结果无损的情况下实现匹配量隐藏。仿真结果表明,与当前最高效的方案XorMM相比,所提方案能够以增加10%的存储开销为代价,减小90%的查询计算开销,显著提高查询效率。

关键词: 云存储, 可搜索加密, 匹配量隐藏, 结构化加密, 分层结构

Abstract:

The volume-hiding encrypted multi-map (EMM) scheme is able to prevent attackers from inferring plaintext through the volume leakage, but existing solutions have problems with large storage and search computational costs.Based on the characteristic that the volume of the searched data often follows Zipf’s law, a hierarchical volume-hiding EMM scheme was proposed.Compared to the plain scheme that filled all keys’ volumes equally, converting the filling of the overall data into the filling of multiple sub-data blocks could reduce storage costs, and also achieved constant level complexity query overhead.Security analysis shows that the proposed scheme can achieve hidden matching volume without loss of query results.Simulation results show that compared with the most efficient scheme XorMM, the proposed scheme can increase the storage overhead by 10%, reduce the search computing overhead by 90%, and significantly improve the search efficiency.

Key words: cloud storage, searchable encryption, volume-hiding, structured encryption, hierarchical structure

中图分类号: 

No Suggested Reading articles found!