Securing distributed storage systems based on arbitrary regenerating codes

Abstract

This paper proposes a coding scheme to securely store a secret file in a distributed storage system that uses an arbitrary regenerating code. Our scheme encodes the secret file to the input of a certain regenerating code by using the coset coding scheme with a maximum rank distance (MRD) code. We show that our scheme can protect the secret file from being leaked to an eavesdropper in the distributed storage system. Existing security schemes for distributed storage systems are based on specific regenerating codes, and they cannot be used with other regenerating codes. In contrast, our scheme can guarantee the security against the eavesdropper independently of the construction of the underlying regenerating code.