Weakly Secure Summation with Colluding Users
Weakly Secure Summation with Colluding Users
复制标题
DOI：
10.1109/isit54713.2023.10206930
复制
发表时间：
2023-04
期刊：
影响因子：
--
通讯作者：
Zhou Li;Yizhou Zhao;Hua Sun
中科院分区：
文献类型：
--
作者：
Zhou Li;Yizhou Zhao;Hua Sun
在安全求和中，K个用户（每个用户持有一个输入）希望在服务器处计算输入的和，而不泄露关于所有输入的任何信息，即使服务器可能与用户的任意子集勾结。在这项工作中，我们放松了安全性和共谋约束，其中禁止其信息泄漏的输入集合来自预定的集合集合（例如，多达S个输入的任何集合）并且合谋用户集合来自另一个预定集合集合（例如，最多T个用户的任何集合）。对于安全输入集和合谋用户集的任意集合，我们刻画了最优随机性假设，即，对于可行的弱安全求和，每个输入比特需要由用户持有的密钥比特的最小数量，这通常涉及求解线性规划。
In secure summation, K users, each holds an input, wish to compute the sum of the inputs at a server without revealing any information about all the inputs even if the server may collude with an arbitrary subset of users. In this work, we relax the security and colluding constraints, where the set of inputs whose information is prohibited from leakage is from a predetermined collection of sets (e.g., any set of up to S inputs) and the set of colluding users is from another predetermined collection of sets (e.g., any set of up to T users). For arbitrary collection of security input sets and colluding user sets, we characterize the optimal randomness assumption, i.e., the minimum number of key bits that need to be held by the users, per input bit, for weakly secure summation to be feasible, which generally involves solving a linear program.