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 条
  • [31] Post-quantum secure multi-party private set-intersection in star network topology
    Debnath, Sumit Kumar
    Choudhury, Tanmay
    Kundu, Nibedita
    Dey, Kunal
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2021, 58
  • [32] Compact and Malicious Private Set Intersection for Small Sets
    Rosulek, Mike
    Trieu, Ni
    CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, : 1166 - 1181
  • [33] Improved Private Set Intersection for Sets with Small Entries
    Bui, Dung
    Couteau, Geoffroy
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2023, PT II, 2023, 13941 : 190 - 220
  • [34] Efficient private multi-party numerical records matching
    Shumin Han
    Derong Shen
    Tiezheng Nie
    Yue Kou
    Ge Yu
    Frontiers of Computer Science, 2020, 14
  • [35] A secure multi-party computation solution to intersection problems of sets and rectangles
    LI Shundong
    Department of Computer Science and Technology
    Progress in Natural Science:Materials International, 2006, (05) : 538 - 545
  • [36] Efficient private multi-party numerical records matching
    Han, Shumin
    Shen, Derong
    Nie, Tiezheng
    Kou, Yue
    Yu, Ge
    FRONTIERS OF COMPUTER SCIENCE, 2020, 14 (05)
  • [37] Multi-Party Private Set Intersection: A Circuit-Based Protocol with Jaccard Similarity for Secure and Efficient Anomaly Detection in Network Traffic
    Su, Jiuheng
    Chen, Zhili
    Yang, Xiaomin
    arXiv, 1600,
  • [38] A secure multi-party computation solution to intersection problems of sets and rectangles
    Li, Shundong
    Dai, Yiqi
    Wang, Daoshun
    Luo, Ping
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2006, 16 (05) : 538 - 545
  • [39] Circuits and multi-party protocols
    Grolmusz, V
    COMPUTATIONAL COMPLEXITY, 1998, 7 (01) : 1 - 18
  • [40] Circuits and multi-party protocols
    V. Grolmusz
    computational complexity, 1998, 7 : 1 - 18