Secure Intersection-sum Computation

被引：0
作者：
Li S.-D. [1 ]
Zhang K.-X. [1 ]
Yang C. [1 ]
Wang Y.-L. [2 ]
机构：
[1] School of Computer Science, Shaanxi Normal University, Xi’an
[2] School of Mathematics and Statistics, Shaanxi Normal University, Xi’an
来源：
Ruan Jian Xue Bao/Journal of Software | 2023年 / 34卷 / 07期
关键词：
cryptography; homomorphic encryption; intersection-sum; random permutation; secure multi-party computation;
D O I：
10.13328/j.cnki.jos.006529
中图分类号：
学科分类号：
摘要：
Secure multi-party computation is one of the hot issues in international cryptographic community. The secure computation of intersection-sum is a new problem of secure multi-party computation. The problem has important theoretical significance and practical value in the fields of industry, commerce, and healthcare. The existing solutions are designed under the condition that the private sets are subsets of a universal set and the intersection cardinality will be leaked and there are some false probabilities. This study, based on the Paillier cryptosystem, designs three protocols for the intersection-sum problem. These protocols are secure in the semi-honest model. Protocol 1 privately computes the number of common identifiers (i.e., user identifier intersection cardinality) and the sum of the integer values associated with these users, Protocol 2 and Protocol 3 privately compute the sum of the associated integer values of intersection elements without leaking the intersection cardinality. The whole computation process does not reveal any more information about their private inputs except for the intersection-sum. The protocols do not restrict that the private sets are subsets of a universal set, and they can be applied in more scenarios. It is proved, by using the simulation paradigm, that these protocols are secure in the semi-honest model. The efficiency of the protocols is also tested by experiments. © 2023 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：3343 / 3353
页数：10
相关论文
共 32 条
  • [1] Yao AC., Protocols for secure computations, Proc. of the 23rd Annual Symp. on Foundations of Computer Science, pp. 160-164, (1982)
  • [2] Ben-Or M, Goldwasser S, Wigfderson A., Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proc. of the 20th Annual ACM Symp. on Theory of Computing, pp. 1-10, (1988)
  • [3] Li SD, Wang DS, Dai YQ., Symmetric cryptographic protocols for extended millionaires’ problem, Science in China Series F: Information Sciences, 52, 6, pp. 974-982, (2009)
  • [4] Freedman MJ, Nissim K, Pinkas B., Efficient private matching and set intersection, Advances in Cryptology (EUROCRYPT 2004). Lecture Notes in Computer Science, 3027, pp. 1-19, (2004)
  • [5] Resenede ACD, de Freitas Aranha D., Faster unbalanced Private Set Intersection in the semi-honest setting, Journal of Cryptographic Engineering, 11, pp. 21-38, (2021)
  • [6] Falk BH, Noble D, Ostrovsky R., Private set intersection with linear communication from general assumptions, Proc. of the 18th ACM Workshop on Privacy in the Electronic Society, pp. 14-25, (2019)
  • [7] Le PH, Ranellucci S, Gordon SD., Two-party private set intersection with an untrusted third party, Proc. of the 2019 ACM SIGSAC Conf. on Computer and Communications Security, pp. 2403-2420, (2019)
  • [8] Ciampi M, Orlandi C., Combining private set-intersection with secure two-party computation, Security and Cryptography for Networks (SCN 2018). Lecture Notes in Computer Science, 11035, pp. 464-482, (2018)
  • [9] Wang ZS, Banawan K, Ulukus S., Multi-party private set intersection: An information-theoretic approach, IEEE Journal on Selected Areas in Information Theory, 2, 1, pp. 366-379, (2021)
  • [10] Debnath SK, Sakurai K, Dey K, Kundu N., Secure outsourced private set intersection with linear complexity, Proc. of the 2021 IEEE Conf. on Dependable and Secure Computing (DSC), pp. 1-8, (2021)
1234