Efficient Multi-Party Private Set Intersection Against Malicious Adversaries

被引:32
|
作者
Zhang, En [1 ]
Liu, Feng-Hao [2 ]
Lai, Qiqi [3 ]
Jin, Ganggang [1 ]
Li, Yu [1 ]
机构
[1] Henan Normal Univ, Xinxiang, Henan, Peoples R China
[2] Florida Atlantic Univ, Boca Raton, FL 33431 USA
[3] Shaanxi Normal Univ, Xian, Shaanxi, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
SECURE COMPUTATION;
D O I
10.1145/3338466.3358927
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Private set intersection (PSI) enables parties to compute the intersection of their inputs without leaking any additional information. Recently, there have been significant advances in the two-party settings with malicious security, making two-party PSI truly practical even compared with the naive insecure method. However, efficient PSI solutions in the more general case (multi-party) are only known for the semi-honest setting. How to construct a practical multiparty solution (especially for large inputs) in the malicious setting remains an important open question in this research line. In this work, we first present an efficient multi-party PSI protocol secure against any malicious adversary that does not simultaneously corrupt two designated parties. Next, we describe how to efficiently enhance security of the protocol when the two designated parties are corrupted. Finally, we present our experiment results for the first protocol, confirming that the efficiency scales linearly in the number of parties of the work Rindal and Rosulek (Eurocrypt 17).
引用
收藏
页码:93 / 104
页数:12
相关论文
共 50 条
  • [21] Multi-party trust computation in decentralized environments in the presence of malicious adversaries
    Dimitriou, Tassos
    Michalas, Antonis
    [J]. AD HOC NETWORKS, 2014, 15 : 53 - 66
  • [22] Practical Multi-party Versions of Private Set Intersection Protocols with Hardware Tokens
    Kang, Ju-Sung
    Yi, Ok-Yeon
    Kim, Min-Ku
    Chang, Ku-Young
    [J]. COMPUTER APPLICATIONS FOR COMMUNICATION, NETWORKING, AND DIGITAL CONTENTS, 2012, 350 : 72 - +
  • [23] Secure Multi-Party Private Set Intersection with Semi-Honest Nodes
    Najarkolaei, Seyed Reza Hoseini
    Aref, Mohammad Reza
    [J]. 2022 10TH IRAN WORKSHOP ON COMMUNICATION AND INFORMATION THEORY, IWCIT, 2022,
  • [24] Efficient and Collusion Resistant Multi-party Private Set Intersection Protocols for Large Participants and Small Sets Setting
    Wei, Lifei
    Liu, Jihai
    Zhang, Lei
    Zhang, Wuji
    [J]. CYBERSPACE SAFETY AND SECURITY, CSS 2022, 2022, 13547 : 118 - 132
  • [25] Multi-party Threshold Private Set Intersection Protocol Based on Robust Secret Sharing
    Zhang, En
    Qin, Lei-Yong
    Yang, Ren-Lin
    Li, Gong-Li
    [J]. Ruan Jian Xue Bao/Journal of Software, 2023, 34 (11): : 5424 - 5441
  • [26] Multi-party Threshold Private Set Intersection Cardinality Based On Encrypted Bloom Filter
    Zhou, Jie
    Su, Daizhao
    Deng, Jiao
    [J]. 2023 IEEE INTERNATIONAL CONFERENCES ON INTERNET OF THINGS, ITHINGS IEEE GREEN COMPUTING AND COMMUNICATIONS, GREENCOM IEEE CYBER, PHYSICAL AND SOCIAL COMPUTING, CPSCOM IEEE SMART DATA, SMARTDATA AND IEEE CONGRESS ON CYBERMATICS,CYBERMATICS, 2024, : 503 - 511
  • [27] Practical Multi-party Private Set Intersection from Symmetric-Key Techniques
    Kolesnikov, Vladimir
    Matania, Naor
    Pinkas, Benny
    Rosulek, Mike
    Trieu, Ni
    [J]. CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 1257 - 1272
  • [28] An unconditionally secure protocol for multi-party set intersection
    Li, Ronghua
    Wu, Chuankun
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2007, 4521 : 226 - +
  • [29] Peer-to-peer secure multi-party numerical computation facing malicious adversaries
    Bickson, Danny
    Reinman, Tzachy
    Dolev, Danny
    Pinkas, Benny
    [J]. PEER-TO-PEER NETWORKING AND APPLICATIONS, 2010, 3 (02) : 129 - 144
  • [30] Peer-to-peer secure multi-party numerical computation facing malicious adversaries
    Danny Bickson
    Tzachy Reinman
    Danny Dolev
    Benny Pinkas
    [J]. Peer-to-Peer Networking and Applications, 2010, 3 : 129 - 144