An Efficient Deduplication Scheme based on Chinese Remainder Theorem (CRT)

Abstract

This paper proposes a secure data deduplication scheme which integrates fault tolerance, confidentiality and efficient key management. It adopts a secret sharing algorithm based on a Permutation Ordered Binary (POB) number system to decompose the data block into multiple random shares, and enhances data security by introducing the Proof of Ownership (PoW) concept. Moreover, our scheme applies a secret sharing algorithm based on the Chinese Remainder Theorem (CRT) to divide the key into multiple random blocks and sends them to the corresponding Key Management Server (KMS) to minimize the key overhead. Experimental results show that our scheme overwhelms the other schemes in terms of function and efficiency.