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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Guanxiong HA, Qiaowen JIA, Hang CHEN, Chunfu JIA
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2022-08-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2022151
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1000-436X