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

与合谋用户的弱安全求和

Weakly Secure Summation with Colluding Users

Zhou Li, Yizhou Zhao, Hua Sun

AI总结:

本文研究弱安全求和问题,在任意安全输入集合族与合谋用户集合族约束下,通过线性规划刻画每个输入比特所需的最小密钥比特数,给出最优随机性假设。

摘要:

在安全求和中,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 {\em all the inputs} even if the server may collude with {\em 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.

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

↑