Practical Traceable Over-Threshold Multi-Party Private Set Intersection
Le Yang, Weijing You, Huiyang He, Kailiang Ji, Jingqiang Lin
摘要
Multi-Party Private Set Intersection (MP-PSI) with threshold enhances the flexibility of MP-PSI by disclosing elements present in at least participants' sets, rather than requiring elements to appear in all sets. In scenarios where each participant is responsible for its dataset, e.g., digital forensics, MP-PSI with threshold is expected to disclose both intersection elements and corresponding holders such that elements are traceable and hence the reliability of intersection is guaranteed. We refer to MP-PSI with threshold supporting traceability as Traceable Over-Threshold Multi-Party Private Set Intersection (T-OT-MP-PSI). However, research on such protocols remains limited, and the current solution is resistant to semi-honest participants at the cost of considerable computational overhead. In this paper, we propose two novel Traceable OT-MP-PSI protocols. The first protocol is the underlineEfficient underlineTraceable OT-MP-PSI (ET-OT-MP-PSI), which combines Shamir's secret sharing with oblivious programmable pseudorandom function, achieving significantly improved efficiency with resistance to at most semi-honest participants. The second one is the underlineSecurity-enhanced underlineTraceable OT-MP-PSI (ST-OT-MP-PSI), which achieves security against up to semi-honest participants by further leveraging oblivious linear evaluation protocol. Compared to the recent Traceable OT-MP-PSI protocol by Mahdavi et al., our protocols eliminate the security assumption that certain special parties do not collude and provide stronger security guarantees. We implemented our proposed protocols and conducted extensive experiments under various settings. We compared the performance of our protocols with that of Mahdavi et al.'s protocol. While our Traceable OT-MP-PSI protocols enhance security, experimental results demonstrate high efficiency. For instance, given 5 participants, with threshold of 3, and set sizes are , our ET-OT-MP-PSI protocol is 15056 faster, and the ST-OT-MP-PSI is 505 faster, compared to Mahdavi et al.'s protocol.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper6
- Efficient Batched Oblivious PRF with Applications to Private Set IntersectionVladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni TrieuCCS 2016 · 被引用 429 次
- Practical Multi-party Private Set Intersection from Symmetric-Key TechniquesVladimir Kolesnikov, Naor Matania, Benny Pinkas, Mike Rosulek 等CCS 2017 · 被引用 247 次
- VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLEPeter Rindal, Phillipp SchoppmannEUROCRYPT 2021 · 被引用 159 次
- Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSINishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi Bhavana Obbattu 等CCS 2021 · 被引用 50 次
- Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-SharingYing Gao, Yuanchao Luo, Longxin Wang, Xiang Liu 等CCS 2024 · 被引用 4 次
相关 Paper
- Practical Multi-Party Private Set Intersection with Reducible Zero-SharingYewei Guan, Hua Guo, Man Ho Au, Jiarong Huo 等S&P 2026
- SoK: Collusion-resistant Multi-party Private Set Intersections in the Semi-honest ModelJelle Vos, Mauro Conti, Zekeriya ErkinS&P 2024 · 被引用 15 次
- Private Set Intersection in the Internet Setting from Lightweight Oblivious PRFMelissa Chase, Peihan MiaoCRYPTO 2020 · 被引用 158 次
- Efficient Multiparty Probabilistic Threshold Private Set IntersectionFeng-Hao Liu, En Zhang, Leiyong QinCCS 2023 · 被引用 11 次
- Private Set Intersection and other Set Operations in the Third Party SettingFoo Yee Yeo, Jason H. M. YingUSENIX Security 2025
