Locally differentially private distributed algorithms for set intersection and union

作     者：Qiao XUE Youwen ZHU Jian WANG Xingxin LI Ji ZHANG Qiao XUE;Youwen ZHU;Jian WANG;Xingxin LI;Ji ZHANG

作者机构：College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Collaborative Innovation Center of Novel Software Technology and Industrialization Faculty of Health Engineering and Science University of Southern Queensland 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2021年第64卷第11期

页      面：234-236页

核心收录：

学科分类：0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：partly supported by National Key Research and Development Program of China (Grant No. 2017YFB0802300) National Natural Science Foundation of China (Grant No. 61602240) 

主　　题：Information Systems and Communication Service 

摘      要：Dear editor,Privacy-preserving distributed set intersection and union(PPSI, PPSU) have received much attention in recent years because of their wide applications. Most of existing solutions [1, 2] utilize secure multiparty computation protocols(SMCP) [3, 4] to settle the problem, but the SMCP methods are expensive in computation and communication. Even worse, most SMCP methods hardly continue to work if some participants disconnect.