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

张恩 等: 兼顾通信轮数与计算开销的门限多方隐私集合交集协议 1837

In: Proc. of the 2022 ACM on Asia Conf. on Computer and Communications Security. Nagasaki: ACM, 2022. 1098–1112. [doi: 10.1145/
3488932.3523254]
[22] Yang YB, Dong XL, Cao ZF, Shen JC, Li RF, Yang YH, Dou SM. EMPSI: Efficient multiparty private set intersection (with cardinality).
Frontiers of Computer Science, 2024, 18(1): 181804. [doi: 10.1007/s11704-022-2269-0]
[23] Nevo O, Trieu N, Yanai A. Simple, fast malicious multiparty private set intersection. In: Proc. of the 2021 ACM SIGSAC Conf. on
Computer and Communications Security. ACM, 2021. 1151–1165. [doi: 10.1145/3460120.3484772]
[24] Chandran N, Dasgupta N, Gupta D, Obbattu SLB, Sekar S, Shah A. Efficient linear multiparty PSI and extensions to circuit/quorum PSI.
In: Proc. of the 2021 ACM SIGSAC Conf. on Computer and Communications Security. ACM, 2021. 1182–1204. [doi: 10.1145/3460120.
3484591]
[25] Kulshrestha A, Mayer J. Estimating incidental collection in foreign intelligence surveillance: Large-scale multiparty private set
intersection with union and sum. In: Proc. of the 31st USENIX Security Symp. Boston: USENIX Association, 2022. 1705–1722.
[26] Mahdavi RA, Humphries T, Kacsmar B, Krastnikov S, Lukas N, Premkumar JA, Shafieinejad M, Oya S, Kerschbaum F, Blass EO.
Practical over-threshold multi-party private set intersection. In: Proc. of the 36th Annual Computer Security Applications Conf. Austin:
ACM, 2020. 772–783. [doi: 10.1145/3427228.3427267]
[27] Zhang E, Qin LY, Yang RL, Li GL. Multi-party threshold private set intersection protocol based on robust secret sharing. Ruan Jian Xue
Bao/Journal of Software, 2023, 34(11): 5424–5441 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6743.htm [doi:
10.13328/j.cnki.jos.006743]
[28] Liu FH, Zhang E, Qin LY. Efficient multiparty probabilistic threshold private set intersection. In: Proc. of the 2023 ACM SIGSAC Conf.
on Computer and Communications Security. Copenhagen: ACM, 2023. 2188–2201. [doi: 10.1145/3576915.3623158]
[29] Mohanty T, Srivastava V, Debnath SK, Das AK, Sikdar B. Quantum secure threshold private set intersection protocol for IoT-enabled
privacy-preserving ride-sharing application. IEEE Internet of Things Journal, 2024, 11(1): 1761–1772. [doi: 10.1109/JIOT.2023.3291132]
[30] Ghosh S, Simkin M. The communication complexity of threshold private set intersection. In: Proc. of the 39th Annual Int’l Cryptology
Conf. on Advances in Cryptology. Santa Barbara: Springer, 2019. 3–29. [doi: 10.1007/978-3-030-26951-7_1]
[31] Badrinarayanan S, Miao PH, Raghuraman S, Rindal P. Multi-party threshold private set intersection with sublinear communication. In:
Proc. of the 24th IACR Int’l Conf. on Public-key Cryptography. Springer, 2021. 349–379. [doi: 10.1007/978-3-030-75248-4_13]
[32] Ghosh S, Simkin M. Threshold private set intersection with better communication complexity. In: Proc. of the 26th IACR Int’l Conf. on
Public-key Cryptography. Atlanta: Springer, 2023. 251–272. [doi: 10.1007/978-3-031-31371-4_9]
[33] Wei LF, Liu JH, Zhang L, Ning JT. Two cloud-assisted over-threshold multi-party private set intersection calculation protocol. Ruan Jian
Xue Bao/Journal of Software, 2023, 34(11): 5442–5456 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6747.htm
[doi: 10.13328/j.cnki.jos.006747]
[34] Pagh R, Rodler FF. Cuckoo hashing. In: Proc. of the 9th Annual European Symp. on Algorithms. Aarhus: Springer, 2001. 121–133. [doi:
10.1007/3-540-44676-1_10]
[35] Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612–613. [doi: 10.1145/359168.359176]
[36] Gao SH. A new algorithm for decoding Reed-Solomon codes. In: Communications, Information and Network Security. New York:
Springer, 2003. 55–68. [doi: 10.1007/978-1-4757-3789-9_5]
[37] Kirsch A, Mitzenmacher M, Wieder U. More robust hashing: Cuckoo hashing with a stash. SIAM Journal on Computing, 2010, 39(4):
1543–1561. [doi: 10.1137/080728743]

附中文参考文献
[2] 张恩, 蔡永泉. 理性的安全两方计算协议. 计算机研究与发展, 2013, 50(7): 1409–1417. [doi: 10.7544/issn1000-1239.2013.20111614]
[15] 李顺东, 周素芳, 郭奕旻, 窦家维, 王道顺. 云环境下集合隐私计算. 软件学报, 2016, 27(6): 1549–1565. http://www.jos.org.cn/1000-
9825/4996.htm [doi: 10.13328/j.cnki.jos.004996]
[16] 马敏, 付钰, 黄凯, 贾潇风. 基于秘密共享的轻量级隐私保护 ViT 推理框架. 通信学报, 2024, 45(4): 27–38. [doi: 10.11959/j.issn.1000-
436x.2024025]
[27] 张恩, 秦磊勇, 杨刃林, 李功丽. 基于弹性秘密共享的多方门限隐私集合交集协议. 软件学报, 2023, 34(11): 5424–5441. http://www.
jos.org.cn/1000-9825/6743.htm [doi: 10.13328/j.cnki.jos.006743]
[33] 魏立斐, 刘纪海, 张蕾, 宁建廷. 双云辅助的超阈值多方隐私集合交集计算协议. 软件学报, 2023, 34(11): 5442–5456. http://www.jos.
org.cn/1000-9825/6747.htm [doi: 10.13328/j.cnki.jos.006747]

作者简介
张恩, 博士, 教授, CCF 高级会员, 主要研究领域为网络安全, 密码协议设计, 隐私保护.
黄昱晨, 硕士, 主要研究领域为密码协议, 安全多方计算.
郑东, 博士, 教授, 博士生导师, 主要研究领域为密码学理论与云安全.
禹勇, 博士, 教授, 博士生导师, 主要研究领域为公钥密码理论及应用, 区块链安全, 数据安全与隐私保护.