通信学报 ›› 2022, Vol. 43 ›› Issue (8): 17-29.doi: 10.11959/j.issn.1000-436x.2022151

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

无第三方服务器的基于数据流行度的加密去重方案

哈冠雄1,2, 贾巧雯3, 陈杭1,2, 贾春福1,2   

  1. 1 南开大学网络空间安全学院,天津 300350
    2 天津市网络与数据安全技术重点实验室,天津 300350
    3 中国科学院软件研究所,北京 100190
  • 修回日期:2022-07-27 出版日期:2022-08-25 发布日期:2022-08-01
  • 作者简介:哈冠雄(1995- ),男,回族,天津人,南开大学博士生,主要研究方向为云数据安全、密码学应用、加密数据去重
    贾巧雯(1992- ),女,天津人,中国科学院软件研究所博士生,主要研究方向为并行编程和软件验证、计算机系统安全
    陈杭(1998- ),女,天津人,南开大学硕士生,主要研究方向为密码学应用、加密去重
    贾春福(1967- ),男,河北文安人,博士,南开大学教授、博士生导师,主要研究方向为网络与信息安全、可信计算、恶意代码分析、密码学及应用等
  • 基金资助:
    国家重点研发计划基金资助项目(2018YFA0704703);国家自然科学基金资助项目(61972215);国家自然科学基金资助项目(61972073);国家自然科学基金资助项目(62172238);天津市自然科学基金资助项目(20JCZDJC00640)

Data popularity-based encrypted deduplication scheme without third-party servers

Guanxiong HA1,2, Qiaowen JIA3, Hang CHEN1,2, Chunfu JIA1,2   

  1. 1 College of Cyber Science, Nankai University, Tianjin 300350, China
    2 Tianjin Key Laboratory of Network and Data Security Technology, Tianjin 300350, China
    3 Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
  • Revised:2022-07-27 Online:2022-08-25 Published:2022-08-01
  • Supported by:
    The National Key Research and Development Program of China(2018YFA0704703);The National Natural Science Foundation of China(61972215);The National Natural Science Foundation of China(61972073);The National Natural Science Foundation of China(62172238);The Natural Science Foundation of Tianjin(20JCZDJC00640)

摘要:

在加密去重系统中,基于流行度为数据设定不同级别的安全保护可有效平衡数据安全与存储效率。现有方案均需引入第三方服务器协助统计数据流行度,而第三方易成为单点故障和效率瓶颈。针对此问题,提出了一个无第三方服务器的基于数据流行度的加密去重方案,基于Count-Min sketch算法和Merkle Puzzles协议实现数据流行度的安全统计,并通过用户间执行 sPAKE 协议实现不流行数据的加密去重。安全性分析和实验评估表明所提方案是安全且高效的。

关键词: 云存储, 加密去重, 数据流行度, Count-Minsketch算法, sPAKE协议

Abstract:

It is effective to balance data security and storage efficiency for setting different levels of security protection for data based on popularity in encrypted deduplication systems.Existing schemes all need introduce a trusted third-party for recording data popularity, while the third party is prone to a single point of failure and efficiency bottleneck.To address this problem, a popularity-based encrypted deduplication scheme without third-party servers was proposed, which accurately recorded the data popularity based on the Count-Min sketch algorithm and Merkle Puzzles protocol, and achieved encrypted deduplication of unpopular data through the sPAKE protocols performed among users.Security analysis and experimental evaluation show that the proposed scheme is secure and efficient.

Key words: cloud storage, encrypted deduplication, data popularity, Count-Min sketch algorithm, sPAKE protocol

中图分类号: 

No Suggested Reading articles found!