Secure MatDot codes: a secure, distributed matrix multiplication scheme

Secure MatDot codes: a secure, distributed matrix multiplication scheme
复制标题

DOI:
10.1109/itw54588.2022.9965839
复制
发表时间:
2022-11
期刊:
2022 IEEE Information Theory Workshop (ITW)
影响因子:
--
通讯作者:
Hiram H. López;Gretchen L. Matthews;Daniel Valvo
Hiram H. López;Gretchen L. Matthews;Daniel Valvo
中科院分区:
其他
文献类型:
--
作者:
Hiram H. López;Gretchen L. Matthews;Daniel Valvo

文献摘要

相似文献

本文介绍了安全的MATDOT代码,这是一个评估代码系列,该代码通过仔细选择利用双代码属性的评估点来支持安全的分布式矩阵乘法。我们表明,安全的MATDOT代码通过使用本地可回收的代码为用户提供安全性。这些新代码补充了最近研究的离散傅立叶变换代码,用于分布式矩阵乘法方案,该方案也为用户提供了安全性。在某些情况下,对于安全的MATDOT代码提供较低成本的家庭和实例,相关成本都是相同的。此外,安全MATDOT代码通过预先识别最快的服务器来处理矩阵乘法的替代方法。通过这种方式,它可以使用较少的服务器来确定产品,而较少的服务器比MATDOT代码确定了提前指定的产品,该代码获得了分布式矩阵乘法方案的最佳恢复阈值。
This paper presents secure MatDot codes, a family of evaluation codes that support secure distributed matrix multiplication via a careful selection of evaluation points that exploit the properties of the dual code. We show that the secure MatDot codes provide security against the user by using locally recoverable codes. These new codes complement the recently studied discrete Fourier transform codes for distributed matrix multiplication schemes that also provide security against the user. There are scenarios where the associated costs are the same for both families and instances where the secure MatDot codes offer a lower cost. In addition, the secure MatDot code provides an alternative way to handle the matrix multiplication by identifying the fastest servers in advance. In this way, it can determine a product using fewer servers, specified in advance, than the MatDot codes which achieve the optimal recovery threshold for distributed matrix multiplication schemes.