4.5 Article

Secure similarity-based cloud data deduplication in Ubiquitous city

Journal

PERVASIVE AND MOBILE COMPUTING
Volume 41, Issue -, Pages 231-242

Publisher

ELSEVIER
DOI: 10.1016/j.pmcj.2017.03.010

Keywords

Secure deduplication; Ubiquitous city; Content-defined chunking; Proofs of ownership

Funding

  1. National Natural Science Foundation of China [61572382]
  2. China 111 Project [B16037]
  3. National High Technology Research and Development Program (863 Program) of China [2015AA016007]
  4. Natural Science Basic Research Plan in Shaanxi Province of China [2016JZ021]
  5. Guangxi Cooperative Innovation Center of cloud computing and Big Data [YD16506]
  6. Guangxi Colleges and Universities Key Laboratory of cloud computing and complex systems [YF16101]
  7. CICAEET fund
  8. PAPD fund

Ask authors/readers for more resources

Ubiquitous city, a wonderful vision of future urban, enables citizens to access to any infrastructure and enjoy high quality urban services by integrating information and communication technologies into urban management. However, it inevitably brings a huge amount of data in the Ubiquitous city scenario. It makes how to efficiently manage the everincreasing datum while preserving data privacy a challenge task. To cope with the above issue, secure data deduplication has attracted considerable interests both academic and industrial community. It can reduce the amount of storage cost by eliminating duplicate data copies, while providing data privacy. Although message-locked encryption has been widely adopted to perform secure cross-client deduplication, it will bring many additional metadata located both client and cloud sides. Recently, some researchers proposed a novel extension of message-locked encryption, named block-level message-locked encryption (BL-MLE), in which block keys are encapsulated into block tags to save metadata storage space. We argue that BL-MLE suffers from high computation overhead for block tag comparison, especially in dissimilar files setting. In this paper, we propose a novel secure similarity-based data deduplication scheme by integrating the technologies of bloom filter and content-defined chunking, which can significantly reduce the computation overhead by only performing deduplication operations for similar files. Security and efficiency evaluations show that the proposed scheme can achieve the desired security goals, while providing a comparable computation overhead. (C) 2017 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available