University of California San Francisco
In this paper, the authors present explicit codes for distributed storage that, in the presence of repair dynamics, provide information theoretic privacy and security from passive eavesdroppers and/or malicious adversaries. These codes meet previously derived lower bounds on the resources of storage and bandwidth utilized. This paper turns out to be an instance of a non-multicast network coding problem with nodal-security requirements, and their results show that, surprisingly, the capacity is achieved via scalar linear codes in this instance. An auxiliary result on Private Information Retrieval (PIR) for erasure-coded systems is also presented.