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

信息论视角下的去中心化安全聚合与用户丢失

Information-Theoretic Decentralized Secure Aggregation with User Dropouts

Guangxi University(广西大学);Technical University of Berlin(柏林工业大学);Southwest University(西南大学)

Zhou Li, Xiang Zhang, Yizhou Zhao, Han Yu, Giuseppe Caire

AI总结:

本文研究了在用户丢失情况下信息论视角下的去中心化安全聚合的基本限制,提出了一种两轮通信协议,在用户丢失和合谋情况下,通过构造相关秘密密钥实现安全聚合,并证明了最优通信速率区域。

摘要:

本文研究了在用户丢失情况下信息论视角下的去中心化安全聚合的基本限制。我们考虑了一个完全去中心化的网络,其中K个用户通过广播信道通信,没有可信的聚合服务器。每个用户持有私有输入,并旨在恢复存活用户输入的总和(用户可能丢失),同时确保即使该用户与其他用户合谋,也不会泄露关于个体输入的额外信息。考虑了一种两轮通信协议,假设至少U个用户存活,且每个用户最多可以与其他T个用户合谋。在此设置中,最优通信速率区域被完全表征:我们证明如果U≤T+1,则DSA不可行;否则,最优速率区域由R₁≥1和R₂≥1/(U-T-1)给出,其中R₁和R₂分别表示第一轮和第二轮通信速率。所提出的聚合方案基于由(T+1)个私有最大距离可分离(MDS)矩阵构造的相关秘密密钥,同时提供了对用户丢失和合谋的鲁棒性。我们还推导了紧致的反向界限,以证明所提出方案的最优性。我们的结果表明,最优的第二轮通信速率仅取决于有效的冗余水平U-T-1,而与总用户数无关。

英文摘要:

This paper investigates the fundamental limits of information-theoretic decentralized secure aggregation (DSA) with user dropouts. We consider a fully decentralized network where $K$ users communicate over broadcast channels without a trusted aggregation server. Each user holds a private input and aims to recover the sum of the surviving users' inputs (users may drop) while ensuring that no additional information about individual inputs is revealed to that user, even if it can collude with other users. A two-round communication protocol is considered, where we assume at least $U$ users survive and each user can collude with at most $T$ other users. For this setting, the optimal communication rate region is fully characterized: we show that DSA is infeasible if $U\le T+1$; otherwise, the optimal rate region is given by $R_1\geq 1$ and $R_2\geq \frac{1}{U-T-1}$, where $R_1$ and $R_2$ denote the first- and second-round communication rates, respectively. The proposed aggregation scheme is based on correlated secret keys constructed from $(T+1)$-private maximum distance separable (MDS) matrices, which simultaneously provide robustness against user dropouts and security against collusion. We also derive tight converse bounds that establish the optimality of the proposed scheme. Our result shows that the optimal second-round communication rate depends only on the effective redundancy level $U-T-1$ regardless the total number of users.

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

↑