论文标题
$ x $ -Secure $ t $ - 私有联邦子模型学习，并具有弹性辍学力
$X$-Secure $T$-Private Federated Submodel Learning with Elastic Dropout Resilience
论文作者
论文摘要
这项工作受到最近对联合子模型学习的兴趣的激励，探讨了私人阅读和写作的基本问题，并根据$ n $分布式服务器存储的数据库，该数据库根据$ x $ secure-secure-secure Secure threshold threshold秘密共享计划。一个接一个地，各种用户希望检索其所需的文件，本地处理信息，然后在分布式数据库中更新文件，同时将所需文件的身份从任何最多的$ t $ culluding服务器设置中保留。服务器的可用性会随着时间而变化，因此需要弹性辍学能力。 The main contribution of this work is an adaptive scheme, called ACSA-RW, that takes advantage of all currently available servers to reduce its communication costs, fully updates the database after each write operation even though the database is only partially accessible due to server dropouts, and ensures a memoryless operation of the network in the sense that the storage structure is preserved and future users may remain oblivious of the past history of server dropouts. ACSA-RW构建基于最初为Xstpir引入的CSA代码，已被证明是用于安全分布式矩阵乘法问题的天然解决方案。 ACSA-RW achieves the desired private read and write functionality with elastic dropout resilience, matches the best results for private-read from PIR literature, improves significantly upon available baselines for private-write, reveals a striking symmetry between upload and download costs, and exploits redundant storage dimensions to accommodate arbitrary read and write dropout servers up to certain threshold values.它还在Kairouz等人的肯定问题中回答。通过利用私人读写操作的联合设计中的协同收益。
Motivated by recent interest in federated submodel learning, this work explores the fundamental problem of privately reading from and writing to a database comprised of $K$ files (submodels) that are stored across $N$ distributed servers according to an $X$-secure threshold secret sharing scheme. One after another, various users wish to retrieve their desired file, locally process the information and then update the file in the distributed database while keeping the identity of their desired file private from any set of up to $T$ colluding servers. The availability of servers changes over time, so elastic dropout resilience is required. The main contribution of this work is an adaptive scheme, called ACSA-RW, that takes advantage of all currently available servers to reduce its communication costs, fully updates the database after each write operation even though the database is only partially accessible due to server dropouts, and ensures a memoryless operation of the network in the sense that the storage structure is preserved and future users may remain oblivious of the past history of server dropouts. The ACSA-RW construction builds upon CSA codes that were originally introduced for XSTPIR and have been shown to be natural solutions for secure distributed matrix multiplication problems. ACSA-RW achieves the desired private read and write functionality with elastic dropout resilience, matches the best results for private-read from PIR literature, improves significantly upon available baselines for private-write, reveals a striking symmetry between upload and download costs, and exploits redundant storage dimensions to accommodate arbitrary read and write dropout servers up to certain threshold values. It also answers in the affirmative an open question by Kairouz et al. by exploiting synergistic gains from the joint design of private read and write operations.
