Page 395 - 《软件学报》2026年第4期

1836 软件学报 2026 年第 37 卷第 4 期

6 总 结

本文针对现有 TMP-PSI 协议仅允许指定参与方获取交集信息以及计算开销大与通信轮数多的问题, 设计了
一种兼顾通信轮数与计算开销的参与方门限测试方法, 提出了两种不同场景下的门限多方隐私集合交集方案. 第
1 种方案是指定参与方获取交集结果, 通过降低通信轮数和减少计算复杂度, 能有效提高运行效率. 第 2 种方案通
过改变秘密份额分发方式, 使得秘密分发者在没有额外增加通信轮数和计算开销的同时, 实现了多参与方计算私
有集合中交集信息的同时不泄露交集以外任何信息. 通过算法分析与实验结果表明, 所设计的协议与现有的方案
相比拥有更好的性能.

References
[1] Garimella G, Pinkas B, Rosulek M, Trieu N, Yanai A. Oblivious key-value stores and amplification for private set intersection. In: Proc.
of the 41st Annual Int’l Cryptology Conf. Springer, 2021. 395–425. [doi: 10.1007/978-3-030-84245-1_14]
[2] Zhang E, Cai YQ. Rational secure two-party computation protocol. Journal of Computer Research and Development, 2013, 50(7):
1409–1417 (in Chinese with English abstract). [doi: 10.7544/issn1000-1239.2013.20111614]
[3] Bui D, Couteau G. Improved private set intersection for sets with small entries. In: Proc. of the 26th IACR Int’l Conf. on Public-key
Cryptography. Atlanta: Springer, 2023. 190–220. [doi: 10.1007/978-3-031-31371-4_7]
[4] Shi RH, Li YF. Quantum private set intersection cardinality protocol with application to privacy-preserving condition query. IEEE Trans.
on Circuits and Systems I: Regular Papers, 2022, 69(6): 2399–2411. [doi: 10.1109/TCSI.2022.3152591]
[5] Rindal P, Schoppmann P. VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE. In: Proc. of the 40th Annual Int’l Conf. on the
Theory and Applications of Cryptographic Techniques. Zagreb: Springer, 2021. 901–930. [doi: 10.1007/978-3-030-77886-6_31]
[6] He YY, Tan XY, Ni JB, Yang LT, Deng XJ. Differentially private set intersection for asymmetrical ID alignment. IEEE Trans. on
Information Forensics and Security, 2022, 17: 3479–3494. [doi: 10.1109/TIFS.2022.3207911]
[7] Wang YH, Huang Q, Li HB, Xiao MY, Ma S, Susilo W. Private set intersection with authorization over outsourced encrypted datasets.
IEEE Trans. on Information Forensics and Security, 2021, 16: 4050–4062. [doi: 10.1109/TIFS.2021.3101059]
[8] Qian YL, Shen J, Vijayakumar P, Sharma PK. Profile matching for IoMT: A verifiable private set intersection scheme. IEEE Journal of
Biomedical and Health Informatics, 2021, 25(10): 3794–3803. [doi: 10.1109/JBHI.2021.3088289]
2
[9] Ling GW, Tang F, Cai CC, Shan JY, Xue HY, Li WL, Tang P, Huang XY, Qiu WD. P FRPSI: Privacy-preserving feature retrieved
private set intersection. IEEE Trans. on Information Forensics and Security, 2023, 19: 2201–2216. [doi: 10.1109/TIFS.2023.3343973]
[10] Dörre F, Mechler J, Müller-Quade J. Practically efficient private set intersection from trusted hardware with side-channels. In: Proc. of the
29th Int’l Conf. on the Theory and Application of Cryptology and Information Security. Guangzhou: Springer, 2023. 268–301. [doi: 10.
1007/978-981-99-8730-6_9]
[11] Morales D, Agudo I, Lopez J. Private set intersection: A systematic literature review. Computer Science Review, 2023, 49: 100567. [doi:
10.1016/j.cosrev.2023.100567]
[12] Raghuraman S, Rindal P. Blazing fast PSI from improved OKVS and subfield VOLE. In: Proc. of the 2022 ACM SIGSAC Conf. on
Computer and Communications Security. Los Angeles: ACM, 2022. 2505–2517. [doi: 10.1145/3548606.3560658]
[13] Pinkas B, Schneider T, Zohner M. Faster private set intersection based on OT extension. In: Proc. of the 23rd USENIX Conf. on Security
Symp. San Diego: USENIX Association, 2014. 797–812.
[14] Pinkas B, Schneider T, Zohner M. Scalable private set intersection based on OT extension. ACM Trans. on Privacy and Security, 2018,
21(2): 7. [doi: 10.1145/3154794]
[15] Li SD, Zhou SF, Guo YM, Dou JW, Wang DS. Secure set computing in cloud environment. Ruan Jian Xue Bao/Journal of Software,
2016, 27(6): 1549–1565 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4996.htm [doi: 10.13328/j.cnki.jos.004996]
[16] Ma M, Fu Y, Huang K, Jia XF. Light weighted privacy protection ViT inference framework based on secret sharing. Journal on
Communications, 2024, 45(4): 27–38 (in Chinese with English abstract). [doi: 10.11959/j.issn.1000-436x.2024025]
[17] Bay A, Erkin Z, Hoepman JH, Samardjiska S, Vos J. Practical multi-party private set intersection protocols. IEEE Trans. on Information
Forensics and Security, 2022, 17: 1–15. [doi: 10.1109/TIFS.2021.3118879]
[18] Kolesnikov V, Matania N, Pinkas B, Rosulek M, Trieu N. Practical multi-party private set intersection from symmetric-key techniques.
In: Proc. of the 2017 ACM SIGSAC Conf. on Computer and Communications Security. Dallas: ACM, 2017. 1257–1272. [doi: 10.1145/
3133956.3134065]
[19] Zhang E, Liu FH, Lai QQ, Jin GG, Li Y. Efficient multi-party private set intersection against malicious adversaries. In: Proc. of the 2019
ACM SIGSAC Conf. on Cloud Computing Security Workshop. London: ACM, 2019. 93–104. [doi: 10.1145/3338466.3358927]
[20] Wei LF, Liu JH, Zhang L, Wang Q, Zhang WJ, Qian XS. Efficient multi-party private set intersection protocols for large participants and
small sets. Computer Standards & Interfaces, 2024, 87: 103764. [doi: 10.1016/j.csi.2023.103764]
[21] Ben-Efraim A, Nissenbaum O, Omri E, Paskin-Cherniavsky A. PSimple: Practical multiparty maliciously-secure private set intersection.