Technical Program

Paper Detail

Paper IDM.2.3
Paper Title Secure Node Repair of Reed-Solomon Codes
Authors Talha Cihad Gulcu, Unaffiliated, Turkey
Session M.2: Codes for Distributed Storage II
Presentation Lecture
Track Coding for Storage and Memories
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract 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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!