EMPSI:Efficient multiparty private set intersection(with cardinality)

作     者：Yunbo YANG Xiaolei DONG Zhenfu CAO Jiachen SHEN Ruofan LI Yihao YANG Shangmin DOU Yunbo YANG;Xiaolei DONG;Zhenfu CAO;Jiachen SHEN;Ruofan LI;Yihao YANG;Shangmin DOU

作者机构：Shanghai Key Laboratory of Trustworthy ComputingEast China Normal UniversityShanghai 200062China Kunyao Academy of Shanghai Kunyao Network Technology Co.Ltd.Shanghai 201203China PwC US Advisory Shanghai ACShanghai 200233China 

出 版 物：《Frontiers of Computer Science》 (中国计算机科学前沿（英文版）)

年 卷 期：2024年第18卷第1期

页      面：199-213页

核心收录：

学科分类：081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the National Key Research and Development Program of China(2020YFA0712300) in part by the National Natural Science Foundation of China(Grant Nos.62172162,62132005) 

主　　题：intersection cardinal primitive 

摘      要：Multiparty private set intersection(PSI)allows several parties,each holding a set of elements,to jointly compute the intersection without leaking any additional *** the development of cloud computing,PSI has a wide range of applications in privacy ***,it is complex to build an efficient and reliable scheme to protect user *** address this issue,we propose EMPSI,an efficient PSI(with cardinality)protocol in a multiparty *** avoids using heavy cryptographic primitives(mainly rely on symmetric-key encryption)to achieve better *** 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 *** experimental results show that proposed EMPSI(-CA)has better performance and is scalable in the number of clients and the set size.