|GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication
|Zhen Chen, Zhuqing Jia, Zhiying Wang, Syed A. Jafar, University of California Irvine, United States
|D.3: Distributed Matrix Multiplication
|Coded and Distributed Computation
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|A secure multi-party batch matrix multiplication problem (SMBMM) is considered, where the goal is to allow a master to efficiently compute the pairwise products of two batches of massive matrices, by distributing the computation across S servers. Any X colluding servers gain no information about the input, and the master gains no additional information about the input beyond the product. A solution called Generalized Cross Subspace Alignment codes with Noise Alignment (GCSA-NA) is proposed in this work, based on cross-subspace alignment codes. The state of art solution to SMBMM is a coding scheme called polynomial sharing (PS) that was proposed by Nodehi and Maddah-Ali. GCSA-NA outperforms PS codes in several key aspects --- more efficient and secure inter-server communication, lower latency, flexible inter-server network topology, efficient batch processing, and tolerance to stragglers.