Private Intersection-Sum Computation

被引：0
作者：
Li S.-D. [1 ]
Zhao X.-L. [1 ]
Jia Z.-L. [1 ]
机构：
[1] School of Computer Science, Shaanxi Normal University, Shaanxi, Xi’an
来源：
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2023年 / 51卷 / 01期
基金：
中国国家自然科学基金;
关键词：
encryption selection; intersection-sum; private substitution; probabilistic encryption; secure multi-party comptation;
D O I：
10.12263/DZXB.20211444
中图分类号：
学科分类号：
摘要：
As an important branch of cryptography, secure multi-party computation has long been mainly dedicated to solving the joint computation on private data owned by two or more parties. As a scientific computation problem in secure multi-party computation, secure intersection-sum computation plays an important role in privately computing advertising conversion rate. We use private substitution, encryption selection and lifted ElGamal cryptosystem to design secure intersection-sum protocols for different scenarios, that is, small data range and large data range for multi-party. When the proposed scheme is used to solve the secure intersection-sum for two-party, Bob only needs to choose data from the data sent by Alice without performing expensive modular exponentiations, and the two parties do not need to interact multiple times. The computational cost and communication times are reduced. In the multi-party protocols, all parties use encryption selection and private substitution to obtain some ciphertexts and perform computation on the ciphertexts to obtain the ciphertext of the intersection-sum. Theoretical analysis and experimental results show that our protocol is efficient. Finally, we use the simulation paradigm to strictly prove that our protocol is secure. © 2023 Chinese Institute of Electronics. All rights reserved.
引用
收藏
页码：86 / 92
页数：6
相关论文
共 13 条
  • [1] YAO A C., Protocols for secure computations, The 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 160-164, (1982)
  • [2] BEN-OR M, GOLDWASSER S, WIGDERSON A., Completeness theorems for non-cryptographic fault-tolerant distributed computation, The 20th Annual ACM Symposium on Theory of Computing, pp. 1-10, (1988)
  • [3] GOLDREICH O., The Fundamental of Cryptography- Volume: Basic Applications, (2004)
  • [4] BALDI P, BARONIO R, CRISTOFARO E D, Et al., Countering gattaca: Efficient and secure testing of fully-sequenced human genomes, The 18th ACM Conference on Computer And Communications Security, pp. 691-702, (2011)
  • [5] BLUNDO C, CRISTOFARO E D, GASTI P., EsPRESSO: Efficient privacy-preserving evaluation of sample set similarity, Journal of Computer Security, 22, 3, pp. 355-381, (2014)
  • [6] YAN H, CHAPMAN P, EVANS D., Privacy-preserving applications on smartphones, The 6th USENIX Workshop on Hot Topics in Security, (2011)
  • [7] ZHANG E, CHANG J, LI Y., Efficient threshold private set intersection, IEEE Access, 9, pp. 6560-6570, (2021)
  • [8] ION M, KREUTER B, NERGIZ A E, Et al., Private intersection-sum protocol with applications to attributing aggregate ad conversions, IACR Cryptology ePrint Archive, (2017)
  • [9] ION M, KREUTER B, NERGIZ A E, Et al., On deploying secure computing: Private intersection-sum with cardinality, IEEE European Symposium on Security and Privacy, pp. 370-389, (2020)
  • [10] MIAO P, PATEL S, RAYKOVARM, Et al., Two-sided malicious security for private intersection-sum with cardinality, 40th Annual International Cryptology Conference, pp. 3-33, (2020)
12