arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2307.13474cs.ITmath.IT
收藏

基于无意识服务器的安全聚合

Secure Aggregation with an Oblivious Server

Hua Sun

AI总结:

该研究提出一种服务器无意识的安全聚合变体,设计了两轮通信协议,证明了安全计算和的通信与密钥下界,并分析了用户退出场景下的性能变化。

摘要:

安全聚合通常旨在服务器端安全计算来自$K$个用户的输入之和。注意到输入之和可能不可避免地泄露输入信息(当输入非均匀分布时),且通常是用户而非服务器需要得到该和(例如在联邦学习等应用中),我们研究了一种服务器为无意识的安全聚合变体,即服务器仅充当通信协调者/辅助者,帮助用户安全计算输入之和,且在整个过程中无法获知任何信息。我们的通信协议包含一轮用户到服务器的消息传输,以及一轮服务器到每个用户的消息传输,最终每个用户仅能获知所有$K$个输入的和,而服务器无法获取任何输入相关信息。针对该无意识服务器安全聚合问题,我们证明:要安全计算1比特的和,每个用户至少需向服务器发送1比特数据,服务器至少需向每个用户发送1比特数据,每个用户至少需持有2比特的密钥,且所有用户总共至少需持有$K$比特的密钥。此外,当允许用户退出时,最优性能保持不变,唯一的区别是每计算1比特和,每个用户持有的最小密钥大小增加到$K$比特。

英文摘要:

Secure aggregation usually aims at securely computing the sum of the inputs from $K$ users at a server. Noticing that the sum might inevitably reveal information about the inputs (when the inputs are non-uniform) and typically the users (not the server) desire the sum (in applications such as federated learning), we consider a variant of secure aggregation where the server is oblivious, i.e., the server only serves as a communication facilitator/helper to enable the users to securely compute the sum and learns nothing in the process. Our communication protocol involves one round of messages from the users to the server and one round of messages from the server to each user such that in the end each user only learns the sum of all $K$ inputs and the server learns no information about the inputs. For this secure aggregation with an oblivious server problem, we show that to compute $1$ bit of the sum securely, each user needs to send at least $1$ bit to the server, the server needs to send at least $1$ bit to each user, each user needs to hold a key of at least $2$ bits, and all users need to collectively hold at least $K$ key bits. In addition, when user dropouts are allowed, the optimal performance remains the same, except that the minimum size of the key held by each user increases to $K$ bits, per sum bit.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑