Journal on Communications ›› 2022, Vol. 43 ›› Issue (8): 17-29.doi: 10.11959/j.issn.1000-436x.2022151

• Papers • Previous Articles     Next Articles

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)

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

CLC Number: 

No Suggested Reading articles found!