Efficient Multiparty Probabilistic Threshold Private Set Intersection
Feng-Hao Liu, En Zhang, Leiyong Qin
摘要
Threshold private set intersection (TPSI) allows multiple parties to learn the intersection of their input sets only if the size of the intersection is greater than a certain threshold. This task has been demonstrated useful with practical applications, and thus many active research has been conducted. However, current solutions for TPSI are still slow for large input sets e.g., n=2^20 for the set size, and the potentially practical candidates are only secure against semi-honest adversaries. For the basic PSI, there have been efficient and scalable solutions, even in the malicious settings. It is interesting to determine whether adding a threshold feature would inherently incur a large overhead to PSI.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Actively Secure Private Set Intersection in the Client-Server SettingYunqing Sun, Jonathan Katz, Mariana Raykova, Phillipp Schoppmann 等CCS 2024 · 被引用 7 次
- Malicious-Secure Private Set Intersection via Dual ExecutionPeter Rindal, Mike RosulekCCS 2017 · 被引用 135 次
- Practical Traceable Over-Threshold Multi-Party Private Set IntersectionLe Yang, Weijing You, Huiyang He, Kailiang Ji 等NDSS 2026 · 被引用 2 次
- Fast Private Set Intersection from Homomorphic EncryptionHao Chen, Kim Laine, Peter RindalCCS 2017 · 被引用 446 次
- Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSINishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi Bhavana Obbattu 等CCS 2021 · 被引用 50 次
