U’Dedup: Updatable Block-Level Deduplication Scheme Over Similar Data in Fog-Assisted Cloud Storage

Fog-assisted cloud storage enables efficient collection and management of Internet of Things data, while large-scale data raise severe requirements for storage space. Deduplication schemes over similar data have been investigated to relieve the storage pressure. However, existing schemes are designed based on an idealized assumption that users can accept a certain degree of data loss or the stored data modification. When the uploaded data reaches the preset similarity threshold, only one copy will be stored, which causes data loss. Meanwhile, different dynamic operations on only one copy will cause the stored data modification. In this paper, we propose U’Dedup to address the above challenge, which is the first block-level deduplication scheme over similar data. The key component of U’Dedup is a self-built tree data structure that supports different update requirements to avoid data modification without duplicating the stored data. U’Dedup ensures the completeness of all unique data to avoid data loss and constructs a dual deduplication architecture to relieve the computing pressure of cloud. Finally, the security analysis proved that U’Dedup is secure in the random oracle model. Experimental results show that U’Dedup achieves 57.3% 90.6% upload computation cost saving, and at least 9.5× retrieval computation cost reduction.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-05-29
DOI
https://doi.org/10.1109/jiot.2025.3574851
Citations
2
Primary Topic
Cloud Data Security Solutions
Type
article
Field-Weighted Citation Impact
6.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

U’Dedup: Updatable Block-Level Deduplication Scheme Over Similar Data in Fog-Assisted Cloud Storage

Liangmin Wang, Xiaoyu Zhang, Min He
2 citations
IEEE Internet of Things Journal
Cloud Data Security Solutions
6.49
article

U’Dedup: Updatable Block-Level Deduplication Scheme Over Similar Data in Fog-Assisted Cloud Storage

Liangmin Wang, Xiaoyu Zhang, Min He
article en
2 citations

Abstract

Fog-assisted cloud storage enables efficient collection and management of Internet of Things data, while large-scale data raise severe requirements for storage space. Deduplication schemes over similar data have been investigated to relieve the storage pressure. However, existing schemes are designed based on an idealized assumption that users can accept a certain degree of data loss or the stored data modification. When the uploaded data reaches the preset similarity threshold, only one copy will be stored, which causes data loss. Meanwhile, different dynamic operations on only one copy will cause the stored data modification. In this paper, we propose U’Dedup to address the above challenge, which is the first block-level deduplication scheme over similar data. The key component of U’Dedup is a self-built tree data structure that supports different update requirements to avoid data modification without duplicating the stored data. U’Dedup ensures the completeness of all unique data to avoid data loss and constructs a dual deduplication architecture to relieve the computing pressure of cloud. Finally, the security analysis proved that U’Dedup is secure in the random oracle model. Experimental results show that U’Dedup achieves 57.3% 90.6% upload computation cost saving, and at least 9.5× retrieval computation cost reduction.

IEEE Internet of Things JournalVol. 12(16)
Ministry of Education (CL), Southeast University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 4%
Cloud Data Security Solutions
6.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.