Toward A Practical Multi-party Private Set Union
Authors: Jiahui Gao (Arizona State University), Son Nguyen (Arizona State University), Ni Trieu (Arizona State University)
Volume: 2024
Issue: 4
Pages: 622–635
DOI: https://doi.org/10.56553/popets-2024-0133
Abstract: This paper studies a multi-party private set union (mPSU), a fundamental cryptographic problem that allows multiple parties to compute the union of their respective datasets without revealing any additional information. We propose an efficient mPSU protocol which is secure in the presence of any number of colluding semi-honest participants. Our protocol avoids computationally expensive homomorphic operations or generic multi-party computation, thus providing an efficient solution for mPSU. The crux of our protocol lies in the utilization of new cryptographic tool, namely, Membership Oblivious Transfer (mOT). We believe that the mOT may be of independent interest. We implement our mPSU protocol and evaluate its performance. Our protocol shows an improvement of up to $80.84 times$ in terms of running time and $405.73 times$ bandwidth cost compared to the existing state-of-the-art protocols.
Keywords: Private set union, Membership OT, Conditional OPRF
Copyright in PoPETs articles are held by their authors. This article is published under a Creative Commons Attribution 4.0 license.
