Secure Node Repair of Reed-Solomon Codes
Talha Cihad Gülcü · 2020
We address the problem of repairing a failed node of a distributed storage system (DSS) in a secure way. We require the information leakage to the helper nodes and the information gained by the repaired node except for its lost content are both zero. We consider the Reed-Solomon code construction of Tamo et al., 2017 which achieves the cut-set bound. For this DSS setup, we propose a secure node repair algorithm and show that it performs near to optimal in terms of the bandwidth when the rate of RS code is low.