论文标题
模拟安全分布式矩阵乘法在复数上
Analog Secure Distributed Matrix Multiplication over Complex Numbers
论文作者
论文摘要
这项工作考虑了将矩阵乘法在实际或复数上分配给助手服务器的问题，以便将信息泄漏到这些服务器上几乎可以在理论上获得信息。这些服务器被认为是诚实但很有趣的，即它们根据协议工作，但尝试推断有关数据的信息。在有限字段的矩阵乘法的背景下，已经考虑了安全分布式矩阵乘法（SDMM）的问题，这在现实世界应用中并不总是可行的。我们提出了两个方案，这些方案允许根据用例获得可变的安全性，并允许勾结和散布服务器。我们分析了计划的安全性和数值准确性，并观察到准确性和安全性之间的权衡。
This work considers the problem of distributing matrix multiplication over the real or complex numbers to helper servers, such that the information leakage to these servers is close to being information-theoretically secure. These servers are assumed to be honest-but-curious, i.e., they work according to the protocol, but try to deduce information about the data. The problem of secure distributed matrix multiplication (SDMM) has been considered in the context of matrix multiplication over finite fields, which is not always feasible in real world applications. We present two schemes, which allow for variable degree of security based on the use case and allow for colluding and straggling servers. We analyze the security and the numerical accuracy of the schemes and observe a trade-off between accuracy and security.
