Collection Nexus Trimester - 2016 - Fundamental Inequalities and Lower Bounds Theme
Organizer(s)
Date(s)
13/05/2024
Bounds on secure regenerating codes
By Kenneth Shum
Regenerating codes are coding schemes with applications in distributed storage systems, with the aim of repairing an erased storage node efficiently. For functional-repair regenerating codes, the fundamental tradeoff between the repair bandwidth and the amount of data stored in a storage node is characterized by formulating the problem as a single-source multi-cast problem in network coding. For exact-repair regenerating codes, the problem of characterizing the tradeoff between repair bandwidth and storage in general remains a challenging problem, and some breakthrough was obtained recently in some small cases. In this talk, we consider exact-repair regenerating codes in the presence of eavesdroppers, who are capable of reading the bits stored in a storage node. Bound on the rate of regenerating codes such that the eavesdroppers can get no information about the data file is obtained. The bound is shown to be tight in some small cases. This is a joint work with Fangwei Ye.
