Low-Bandwidth Repair of Reed-Solomon Codes and Its Application to Secure Matrix Multiplication

Stanislav Kruglik - Dr
Communication systems

Date: -
Location: Eurecom

Abstract: In this talk, I will introduce the Reed-Solomon repair problem and the innovative Guruswami-Wootters framework, which focuses on repairing erased symbols of Reed-Solomon codes for two matrices. I will then demonstrate how Reed-Solomon codes can facilitate secure multiplication of two matrices and how low-bandwidth techniques can reduce the communication cost of this operation. Short bio: H. M. Kiah, W. Kim, S. Kruglik, S. Ling, and H. Wang, "Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols," IEEE Transactions on Information Theory, vol. 70, no. 8, pp. 5552-5565, Aug. 2024.