TSS: A two‐party secure server‐aid chunking algorithm. (21st September 2021)

• Record Type: Journal Article
• Authors: Tian, Wenlong; Li, Ruixuan; Xu, Zhiyong
• Is Part Of: Concurrency and computation. Volume 34:Number 12(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2021-09-21
• Subjects: metadata size encryption key number -- secure chunking -- secure deduplication -- server‐aid; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.6577
• Languages: English
• ISSNs: 1532-0626

Abstract

Abstract: Chunking is one of the most important processes in a secure deduplication system. It determines the deduplication ratio, metadata size, and the encryption key number. Existing chunking algorithms can be categorized as client‐side chunking algorithm and the server‐aid chunking algorithm. Although the former one can directly be applied into the secure deduplication, it ignores the management overhead caused by the metadata size and encryption key number. Thus, the conventional server‐aid chunking algorithm is proposed. However, it is not secure because the interaction between the client and the server is based on the plaintext. Thus, we propose a two‐party secure server‐aid chunking algorithm, TSS. It supports the secure server‐aid interaction and reduces the metadata size and the encryption key number in the secure deduplication with a comparable deduplication ratio. The theoretical proof and experimental results show that our method outperforms the state‐of‐the‐art chunking algorithm, elastic chunking algorithm.