Efficient multi-party private set intersection protocols for large participants and small sets

被引:3
|
作者
Wei, Lifei [1 ,2 ]
Liu, Jihai [2 ]
Zhang, Lei [2 ]
Wang, Qin [2 ]
Zhang, Wuji [2 ]
Qian, Xiansong [2 ]
机构
[1] Shanghai Maritime Univ, Coll Informat Engn, Shanghai 201306, Peoples R China
[2] Shanghai Ocean Univ, Coll Informat Technol, Shanghai 201306, Peoples R China
基金
中国国家自然科学基金; 上海市自然科学基金;
关键词
Private set intersection; Multi-party; Semi-honest secure; Small set setting; Collusion resistant; Malicious secure;
D O I
10.1016/j.csi.2023.103764
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Private set intersection (PSI) has attracted the researchers and the developers both from academia and industry in cooperating the private data to achieve privacy preserving. Traditional PSI protocols allow the two participants with each private sets interactively calculating the intersection without revealing any additional information. Multi-party private set intersection (MP-PSI) is quite different from the conventional two-party PSI, which could not directly obtain from the two-party PSI, and become an emerging topic in collaborative data analytics from different private data owners. However, the most of the existing MP-PSI protocols always consider the small number of the participants with large set size and the performance drops with the increasing number of participants. In addition, the participants with small set size also bring the heavy communication and computation overhead. To overcome the above drawbacks, we propose two efficient MP-PSI protocols for large number of participants and small set size, and formally prove secure against collision attack in the semi-honest model and malicious model. The experiments show that when the participant number increases from 5 to 50 and the set size scales from 27 to 210, our protocols are faster than the most efficient MP-PSI protocol. Thus, our MP-PSI protocols are considering to be practical solutions, which fit the scenarios in small set size with increasing participants.
引用
下载
收藏
页数:13
相关论文
共 50 条
  • [41] Dual protocols for private multi-party matrix multiplication and trust computations
    Dumas, Jean-Guillaume
    Lafourcade, Pascal
    Orfila, Jean-Baptiste
    Puys, Maxime
    COMPUTERS & SECURITY, 2017, 71 : 51 - 70
  • [42] Two Cloud-assisted Over-threshold Multi-party Private Set Intersection Calculation Protocol
    Wei L.-F.
    Liu J.-H.
    Zhang L.
    Ning J.-T.
    Ruan Jian Xue Bao/Journal of Software, 2023, 34 (11): : 5442 - 5456
  • [43] Efficient Secure Multi-Party Protocols for Decision Tree Classification
    Ichikawa, Atsunori
    Ogata, Wakaha
    Hamada, Koki
    Kikuchi, Ryo
    INFORMATION SECURITY AND PRIVACY, ACISP 2019, 2019, 11547 : 362 - 380
  • [44] Linear Complexity Private Set Intersection for Secure Two-Party Protocols
    Karakoc, Ferhat
    Kupcu, Alptekin
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2020, 2020, 12579 : 409 - 429
  • [45] Practical and Malicious Multiparty Private Set Intersection for Small Sets
    Zhou, Ji
    Liu, Zhusen
    Wang, Luyao
    Zhao, Chuan
    Liu, Zhe
    Zhou, Lu
    ELECTRONICS, 2023, 12 (23)
  • [46] Optimizing multi-party agreement protocols
    Fedotov, Ivan
    Khritankov, Anton
    Barger, Artem
    2022 4TH CONFERENCE ON BLOCKCHAIN RESEARCH & APPLICATIONS FOR INNOVATIVE NETWORKS AND SERVICES (BRAINS), 2022, : 55 - 58
  • [47] A class of protocols for multi-party quantum private comparison based on traveling mode
    Ye Chongqiang
    Li Jian
    Cao Zheng-wen
    QUANTUM INFORMATION PROCESSING, 2021, 20 (02)
  • [48] A class of protocols for multi-party quantum private comparison based on traveling mode
    Ye Chongqiang
    Li Jian
    Cao Zheng-wen
    Quantum Information Processing, 2021, 20
  • [49] Concretely efficient secure multi-party computation protocols: survey and more
    Dengguo Feng
    Kang Yang
    Security and Safety, 2022, 1 (01) : 48 - 90
  • [50] Efficient multi-party challenge-response protocols for entity authentication
    Buttyán, Levente
    Nagy, Attila
    Vajda, István
    Periodica Polytechnica Electrical Engineering, 2001, 45 (01): : 43 - 64