Information Theoretic Secure Aggregation with Uncoded Groupwise Keys
Information Theoretic Secure Aggregation with Uncoded Groupwise Keys
复制标题
使用未编码的分组密钥的信息论安全聚合
DOI：
10.48550/arxiv.2204.11364
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
G. Caire
中科院分区：
文献类型：
--
作者：
Kai Wan;Hua Sun;Mingyue Ji;G. Caire
安全聚合是联邦学习的核心组件，它在中央服务器上聚合来自分布式用户的本地训练模型。这种聚合的“安全”性质包括这样的事实，即除了聚合的本地模型之外，关于本地用户数据的任何信息都不得泄露给服务器。为了保证安全性，一些密钥可能会在用户之间共享（这称为密钥共享阶段）。在密钥共享阶段之后，每个用户屏蔽其训练模型，然后将其发送到服务器（这被称为模型聚合阶段）。本文遵循最初由Zhao和Sun提出的信息论安全聚合问题，目标是刻画模型聚合阶段K个用户的最小通信代价。由于用户退出（这在真实的系统中很常见），服务器可能无法接收来自用户的所有消息。一个安全的聚合方案应该容忍最多K-U个用户的退出，其中U是一个系统参数。最优通信代价是由Zhao和Sun刻画的，但假设用户存储的密钥可以是具有任意依赖性的任意随机变量。基于未编码的分组密钥更便于共享，并且除了联邦学习之外，还可以应用于更广泛的应用，本文在上述问题中加入了一个约束条件，即密钥变量相互独立，并且每个密钥由一组至多S个用户共享，其中S是另一个系统参数。据我们所知，所有现有的安全聚合方案（信息论安全或计算安全）分配编码密钥给用户。我们证明了如果S > K-U，则有一个新的安全K。
Secure aggregation, which is a core component of federated learning, aggregates locally trained models from distributed users at a central server. The “secure” nature of such aggregation consists of the fact that no information about the local users’ data must be leaked to the server except the aggregated local models. In order to guarantee security, some keys may be shared among the users (this is referred to as the key sharing phase). After the key sharing phase, each user masks its trained model which is then sent to the server (this is referred to as the model aggregation phase). This paper follows the information theoretic secure aggregation problem originally formulated by Zhao and Sun, with the objective to characterize the minimum communication cost from the K users in the model aggregation phase. Due to user dropouts, which are common in real systems, the server may not receive all messages from the users. A secure aggregation schemes should tolerate the dropouts of at most K − U users, where U is a system parameter. The optimal communication cost is characterized by Zhao and Sun, but with the assumption that the keys stored by the users could be any random variables with arbitrary dependency. On the motivation that uncoded groupwise keys are more convenient to be shared and could be used in large range of applications besides federated learning, in this paper we add one constraint into the above problem, namely, that the key variables are mutually independent and each key is shared by a group of at most S users, where S is another system parameter. To the best of our knowledge, all existing secure aggregation schemes (with information theoretic security or computational security) assign coded keys to the users. We show that if S > K − U , a new secure K.
与最终用户缓存的组合网络：未编码缓存放置下新的可实现和逆边界
影响因子：
2.5
作者：
Wan, Kai;Tuninetti, Daniela;Ji, Mingyue;Piantanida, Pablo
通讯作者：
Piantanida, Pablo
复合安全组播：选定广播的密钥分配
DOI：
10.1109/jsait.2022.3180889
发表时间：
2022
期刊：
IEEE Journal on Selected Areas in Information Theory
影响因子：
--
作者：
Sun, Hua
通讯作者：
Sun, Hua
使用共享密钥保护组播
影响因子：
2.5
作者：
Sun, Hua
通讯作者：
Sun, Hua