Paper 2025/640 Original: eprint.iacr.org/2025/640 ↗

Multi-Party Private Set Operations from Predicative Zero-Sharing

Minglang Dong
Yu Chen
Cong Zhang
Yujie Bai
Yang Cao
Abstract

Typical protocols in the multi-party private set operations (MPSO) setting enable $m > 2$ parties to perform certain secure computation on the intersection or union of their private sets, realizing a very limited range of MPSO functionalities. Most works in this field focus on just one or two specific functionalities, resulting in a large variety of isolated schemes and a lack of a unified framework in MPSO research. In this work, we present an MPSO framework, which allows $m$ parties, each holding a set, to securely compute any set formulas (arbitrary compositions of a finite number of binary set operations, including intersection, union and difference) on their private sets. Our framework is highly versatile and can be instantiated to accommodate a broad spectrum of MPSO functionalities. To the best of our knowledge, this is the first framework to achieve such a level of flexibility and generality in MPSO, without relying on generic secure multi-party computation (MPC) techniques. Our framework exhibits favorable theoretical and practical performance. With computation and communication complexity scaling linearly with the set size $n$, it achieves optimal complexity that is on par with the naive solution for widely used functionalities, such as multi-party private set intersection (MPSI), MPSI with cardinality output (MPSI-card), and MPSI with cardinality and sum (MPSI-card-sum), for the first time in the standard semi-honest model. Furthermore, the instantiations of our framework, which primarily rely on symmetric-key techniques, provide efficient protocols for MPSI, MPSI-card, MPSI-card-sum, and multi-party private set union (MPSU), with online performance that either surpasses or matches the state of the art in standard semi-honest model. At the technical core of our framework is a newly introduced primitive called predicative zero-sharing. This primitive captures the universality of a number of MPC protocols and is composable. We believe it may be of independent interest.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2025-12-30: last updated
2025-04-08: published
Short URL
https://ia.cr/2025/640
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2025/640,
      author = {Minglang Dong and Yu Chen and Cong Zhang and Yujie Bai and Yang Cao},
      title = {Multi-Party Private Set Operations from Predicative Zero-Sharing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/640},
      year = {2025},
      url = {https://eprint.iacr.org/2025/640}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.