2022/01/02 by Elmahdy, Adel, Kleckler, Michelle, Mohajer, Soheil
#Cryptography and Security (cs.CR) #Distributed #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #Parallel #and Cluster Computing (cs.DC)
paper · doi:10.48550/arxiv.2201.00313
The information-theoretic secure exact-repair regenerating codes for distributed storage systems (DSSs) with parameters (n,k=d,d,ℓ) are studied in this paper. We consider distributed storage systems with n nodes, in which the original data can be recovered from any subset of k=d nodes, and the content of any node can be retrieved from those of any d helper nodes. Moreover, we consider two secrecy constraints, namely, Type-I, where the message remains secure against an eavesdropper with access to the content of any subset of up to ℓ nodes, and Type-II, in which the message remains secure against an eavesdropper who can observe the incoming repair data from all possible nodes to a fixed but unknown subset of up to ℓ compromised nodes. Two classes of secure determinant codes are proposed for Type-I and Type-II secrecy constraints. Each proposed code can be designed for a range of per-node storage capacity and repair bandwidth for any system parameters. They lead to two achievable secrecy trade-offs, for Type-I and Type-II security.