EMPSI: Efficient multiparty private set intersection (with cardinality)

  • Yunbo Yang
  • , Xiaolei Dong*
  • , Zhenfu Cao*
  • , Jiachen Shen*
  • , Ruofan Li
  • , Yihao Yang
  • , Shangmin Dou
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

Multiparty private set intersection (PSI) allows several parties, each holding a set of elements, to jointly compute the intersection without leaking any additional information. With the development of cloud computing, PSI has a wide range of applications in privacy protection. However, it is complex to build an efficient and reliable scheme to protect user privacy. To address this issue, we propose EMPSI, an efficient PSI (with cardinality) protocol in a multiparty setting. EMPSI avoids using heavy cryptographic primitives (mainly rely on symmetric-key encryption) to achieve better performance. In addition, both PSI and PSI with the cardinality of EMPSI are secure against semi-honest adversaries and allow any number of colluding clients (at least one honest client). We also do experiments to compare EMPSI with some state-of-the-art works. The experimental results show that proposed EMPSI (-CA) has better performance and is scalable in the number of clients and the set size.

Original languageEnglish
Article number181804
JournalFrontiers of Computer Science
Volume18
Issue number1
DOIs
StatePublished - Feb 2024

Fingerprint

Dive into the research topics of 'EMPSI: Efficient multiparty private set intersection (with cardinality)'. Together they form a unique fingerprint.

Cite this