Lune

NDSS2026顶会

MinBucket MPSI: Breaking the Max-Size Bottleneck in Multi-Party Private Set Intersection

Binbin Tu, Boyudong Zhu, Yang Cao, Yu Chen

2026年份

摘要

Multi-Party Private Set Intersection (Cardinality) protocol enables TT (T>2)(T > 2) parties, each holding a private set, to jointly compute the intersection (or its cardinality) without revealing any additional information to other parties. To date, all known MPSI (MPSI-Card) protocols require communication complexity that scales linearly with the size of the large set, fundamentally precluding their efficient deployment in real-world applications with heterogeneous input scales. In this work, we present a new framework for MPSI based on newly proposed protocols: batched membership conditional randomness generation and joint private equality test. By instantiating this framework, we develop two MPSI protocols with communication complexities that are linear in the size of the small set and logarithmic in the size of the large set. One protocol offers security against an arbitrary number of colluding parties, while the other secures against (T−2)(T-2) colluding parties. Additionally, we develop a protocol called the joint permuted private equality test and propose the MPSI-Card framework. By instantiating this framework, we derive an MPSI-Card protocol with similar communication efficiency: linear in the small set and logarithmic in the large set, providing security against an arbitrary number of colluding parties. We implement our protocols and conduct extensive experiments over both LAN and WAN networks. Experimental results demonstrate that our protocols achieve significantly better performance as the size difference between the sets or the number of participants holding the small set increases. For the setting, where 55 parties holding large set (size 2202^{20}) and 55 parties holding small set (size 2102^{10}) with a single thread and a 1010 Mbps bandwidth, our MPSI (MPSI-Card) protocol requires only 12.212.2 (12.212.2) MB of communication and 129.86129.86 (130.05130.05) seconds of runtime. Compared with the state-of-the-art MPSI by Wu et al. (USENIX Security 2024) and MPSI-Card by Gao et al. (PETS 2024), our protocol achieves a 157times157times (76times)(76times) reduction in communication cost and a 12.7times12.7times (3.1times)(3.1times) speedup in runtime.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

lune papers fulltext 4c8a786f-63b7-4ff3-b978-7d0c56ad5b5e

它引用的顶会 Paper19

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖