论文标题
安全分布式矩阵乘法的统一根：网格分区案例
Root of Unity for Secure Distributed Matrix Multiplication: Grid Partition Case
论文作者
论文摘要
我们考虑了安全分布式矩阵乘法（SDMM）的问题，其中用户有两个矩阵，并希望在$ n $诚实但好奇的服务器的帮助下，在安全约束下，借助$ n $诚实但好奇的服务器，即任何有关$ a $ a或$ b $的信息都不会泄漏到任何服务器上。本文介绍了A \ emph {新方案}，它考虑了矩阵$ a $ a $ a $ a $ a $ a $ a $ a $ a和$ b $的网格产品分区，该分区的上传成本大大低于文献中现有的结果。由于网格分区是包含内部和外部外部的一般分区，因此事实证明，所提出的方案的通信负载与这些极端情况的最著名协议匹配。
We consider the problem of secure distributed matrix multiplication (SDMM), where a user has two matrices and wishes to compute their product with the help of $N$ honest but curious servers under the security constraint that any information about either $A$ or $B$ is not leaked to any server. This paper presents a \emph{new scheme} that considers a grid product partition for matrices $A$ and $B$, which achieves an upload cost significantly lower than the existing results in the literature. Since the grid partition is a general partition that incorporates the inner and outer ones, it turns out that the communication load of the proposed scheme matches the best-known protocols for those extreme cases.
