Privacy-preserving min and k-th min computations with fully homomorphic encryption
Privacy-preserving min and k-th min computations with fully homomorphic encryption
复制标题
DOI：
10.1109/pccc.2015.7410266
复制
发表时间：
2015-12
期刊：
影响因子：
--
通讯作者：
Bingbing Jiang;Yuan Zhang-
中科院分区：
文献类型：
--
作者：
Bingbing Jiang;Yuan Zhang-
我们设计了一个安全的协议，服务器可以计算所有参与者的数据的最小数量，而保持未知的用户的数据在其执行的附加信息。我们的协议是基于全同态加密，我们利用它来解决安全计算最小值的问题。此外，所使用的FHE方案是一个基于格的密码系统，可以抵抗一些量子对手谁可以进行量子计算的经典查询。我们还将安全的min计算协议扩展为保护隐私的第k次min计算协议，并在半诚实模型的假设下对这两个协议进行了安全性分析。在以前的文献中，他们的解决方案是基于安全的算术和计算以及安全的逐位XOR计算。与之相比，我们的协议更安全。
We design a secure protocol that a server can compute the minimum number of all participants' data while kept unknown additional information about the users' data in its execution. Ours protocol is based on fully homomorphic encryption and we utilize it to fix the problem of securely computing the minimum value. Besides, the used FHE scheme is a lattice-based cryptosystem that can resist some quantum adversaries who can carry out quantum computations on classical queries. We also expand the secure min computing protocol to the privacy-preserving the k-th min computing protocol, and present the security analysis of the two protocols on the assumption of the semi-honest model. In the previous literature, their solutions are based on secure arithmetic sum computations as well as secure bitwise XOR computations. Our protocols are more secure with the comparison to them.