Two Cloud-assisted Over-threshold Multi-party Private Set Intersection Calculation Protocol

被引：0
|
作者：
Wei L.-F. [1 ]
Liu J.-H. [1 ]
Zhang L. [1 ]
Ning J.-T. [2 ,3 ]
机构：
[1] College of Information Technology, Shanghai Ocean University, Shanghai
[2] College of Mathematics and Informatics, Fujian Normal University, Fuzhou
[3] State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences), Beijing
来源：
Ruan Jian Xue Bao/Journal of Software | 2023年 / 34卷 / 11期
关键词：
cloud-assisted; oblivious transfer; over-threshold; private set intersection; secret sharing;
D O I：
10.13328/j.cnki.jos.006747
中图分类号：
学科分类号：
摘要：
The over-threshold multi-party private set intersection (OT-MP-PSI) protocol is a variant of the conventional PSI protocol. This protocol allows m participants to jointly compute the OT intersection for which at least t (t≤m) participants have the common element and ensures that only the participant with the OT element knows whether the element belongs to the OT intersection and nothing else. The OT-MP-PSI protocol extends the practical application scenarios of the PSI protocol. As the existing schemes are all constructed on the basis of expensive public key-based cryptography, their heavy computational burden results in long runtime. This study designs a novel cryptographic component, the oblivious programmable pseudo-random secret-sharing (OPPR-SS) component based on symmetric cryptography. Furthermore, a two cloud-assisted OT-MP-PSI protocol is designed on the basis of the OPPR-SS component, and it assigns the tasks of secret sharing and reconstructing to untrusted cloud servers, respectively, so that they can assist in the completion of those tasks. As a result, participants with weak computation capability can complete the OT-MP-PSI protocol as well. Furthermore, the study proves that the proposed protocol is secure in the semi-honest model. Compared with the existing OT-MP-PSI protocols, the proposed protocol achieves the optimal runtime and communication overhead at both the secret sharing stage and the secret reconstructing stage. The communication complexities of the participants, the secret sharing cloud, and reconstructing cloud are no longer related to the threshold t. The number of communication rounds for the participants is constant, and the communication complexity is merely O(n). The computational complexities of the secret sharing cloud and the secret reconstructing cloud are only related to the number of symmetric cryptographic operations. © 2023 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：5442 / 5456
页数：14
相关论文
共 38 条
  • [1] Kolesnikov V, Kumaresan R, Rosulek M, Trieu N., Efficient batched oblivious PRF with applications to private set intersection, Proc. of the 23rd ACM SIGSAC Conf. on Computer and Communications Security, pp. 818-829, (2016)
  • [2] Chase M, Miao PH., Private set intersection in the internet setting from lightweight oblivious PRF, Proc. of the 40th Annual Int’l Cryptology Conf. on Advances in Cryptology, pp. 34-63, (2020)
  • [3] Dong CY, Chen LQ, Wen ZK., When private set intersection meets big data:An efficient and scalable protocol, Proc. of the 20th ACM SIGSAC Conf. on Computer & Communications Security, pp. 789-800, (2013)
  • [4] Dou JW, Liu XH, Wang WL., Privacy preserving two-party rational set computation, Chinese Journal of Computers, 43, 8, pp. 1397-1413, (2020)
  • [5] Debnath SK, Dutta R., Towards fair mutual private set intersection with linear complexity, Security and Communication Networks, 9, 11, pp. 1589-1612, (2016)
  • [6] Mohassel P, Rindal P, Rosulek M., Fast database joins and PSI for secret shared data, Proc. of the 27th ACM SIGSAC Conf. on Computer and Communications Security, pp. 1271-1287, (2020)
  • [7] Song XF, Gai M, Zhao SN, Jiang H., Privacy-preserving statistics protocol for set-based computation, Journal of Computer Research and Development, 57, 10, pp. 2221-2231, (2020)
  • [8] Wei LF, Liu JH, Zhang L, Wang Q, He CD., Survey of privacy preserving oriented set intersection computation, Journal of Computer Research and Development, 59, 8, pp. 1782-1799, (2020)
  • [9] Demmler D, Rindal P, Rosulek M, Trieu N., PIR-PSI:Scaling private contact discovery, Proc. on Privacy Enhancing Technologies, 2018, 4, pp. 159-178, (2018)
  • [10] Lv SY, Ye JH, Yin SJ, Cheng XC, Feng C, Liu XY, Li R, Li ZH, Liu ZL, Zhou L., Unbalanced private set intersection cardinality protocol with low communication cost, Future Generation Computer Systems, 102, pp. 1054-1061, (2020)
1234