TY - JOUR
T1 - PMPSI
T2 - Privacy-Preserving Predicate-Supporting Multi-Party Private Set Intersection
AU - Gao, Chengzhi
AU - Bao, Yihan
AU - Xu, Chang
AU - Zhu, Liehuang
AU - Liu, Hongyi
AU - Sharif, Kashif
AU - Wang, Pengbo
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2026
Y1 - 2026
N2 - Multi-Party Private Set Intersection (MPSI) protocol allows multiple participants to secretly compute their data intersection without any additional disclosure. However, conventional MPSI protocols treat all participants as identical entities and fail to accommodate the diverse characteristics of participants, which may lead to intersection results that do not align with the requestor's intent. To this end, we introduce a new cryptographic primitive of MPSI, wherein only participants whose attributes satisfy a predicate defined by a designated requestor are eligible to contribute to the intersection computation, termed Predicate-Supporting Multi-party Private Set Intersection (PMPSI). PMPSI enables conditional intersection with strong privacy guarantees. Specifically, PMPSI ensures that the predicate, participant attributes, and match status remain confidential to all entities involved. To instantiate this primitive under the honest-but-curious adversarial model, we design a dual-mode oblivious comparison (DMOC) protocol with two operational versions as a core subroutine and integrate it with threshold homomorphic encryption and encrypted inverse Bloom filter. We formally prove the security of the protocol via simulation-based arguments and implement a prototype to evaluate its efficiency. Experimental results demonstrate that the PMPSI protocol achieves linear computational and communication complexity with respect to the number of participants, confirming its practicality for realistic application scenarios such as secure cross-organizational collaboration and privacy-preserving resource sharing in mobile networks.
AB - Multi-Party Private Set Intersection (MPSI) protocol allows multiple participants to secretly compute their data intersection without any additional disclosure. However, conventional MPSI protocols treat all participants as identical entities and fail to accommodate the diverse characteristics of participants, which may lead to intersection results that do not align with the requestor's intent. To this end, we introduce a new cryptographic primitive of MPSI, wherein only participants whose attributes satisfy a predicate defined by a designated requestor are eligible to contribute to the intersection computation, termed Predicate-Supporting Multi-party Private Set Intersection (PMPSI). PMPSI enables conditional intersection with strong privacy guarantees. Specifically, PMPSI ensures that the predicate, participant attributes, and match status remain confidential to all entities involved. To instantiate this primitive under the honest-but-curious adversarial model, we design a dual-mode oblivious comparison (DMOC) protocol with two operational versions as a core subroutine and integrate it with threshold homomorphic encryption and encrypted inverse Bloom filter. We formally prove the security of the protocol via simulation-based arguments and implement a prototype to evaluate its efficiency. Experimental results demonstrate that the PMPSI protocol achieves linear computational and communication complexity with respect to the number of participants, confirming its practicality for realistic application scenarios such as secure cross-organizational collaboration and privacy-preserving resource sharing in mobile networks.
KW - Multi-party private set intersection
KW - predicate
KW - privacy preserving
UR - https://www.scopus.com/pages/publications/105042718630
U2 - 10.1109/TDSC.2026.3704390
DO - 10.1109/TDSC.2026.3704390
M3 - Article
AN - SCOPUS:105042718630
SN - 1545-5971
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
ER -