On the Tradeoff Region of Secure Exact-Repair Regenerating Codes.

We consider the (n, k, d, ℓ) secure exact-repair regenerating code problem, which generalizes the (n, k, d) exact-repair regenerating code problem with the additional constraint that the stored file needs to be kept information-theoretically secure against an eavesdropper, who can access the data transmitted to regenerate a total of ℓ different failed nodes. For all known results on this problem, ...