跳到主要导航 跳到搜索 跳到主要内容

EMPSI: Efficient multiparty private set intersection (with cardinality)

  • Yunbo Yang
  • , Xiaolei Dong*
  • , Zhenfu Cao*
  • , Jiachen Shen*
  • , Ruofan Li
  • , Yihao Yang
  • , Shangmin Dou
  • *此作品的通讯作者
  • East China Normal University
  • Ltd.
  • PwC US Advisory Shanghai AC

科研成果: 期刊稿件文章同行评审

摘要

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.

源语言英语
文章编号181804
期刊Frontiers of Computer Science
18
1
DOI
出版状态已出版 - 2月 2024

指纹

探究 'EMPSI: Efficient multiparty private set intersection (with cardinality)' 的科研主题。它们共同构成独一无二的指纹。

引用此