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 条
  • [41] Efficient two party and multi party computation against covert adversaries
    Goyal, Vipul
    Mohassel, Payman
    Smith, Adam
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2008, 2008, 4965 : 289 - +
  • [42] Efficient private multi-party numerical records matching
    Han, Shumin
    Shen, Derong
    Nie, Tiezheng
    Kou, Yue
    Yu, Ge
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2020, 14 (05)
  • [43] Efficient Set Operations in the Presence of Malicious Adversaries
    Hazay, Carmit
    Nissim, Kobbi
    [J]. PUBLIC KEY CRYPTOGRAPHY - PKC 2010, PROCEEDINGS, 2010, 6056 : 312 - +
  • [44] General adversaries in unconditional multi-party computation
    Fitzi, M
    Hirt, M
    Maurer, U
    [J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT'99, PROCEEDINGS, 1999, 1716 : 232 - 246
  • [45] Privacy-Preserving Multi-Party Bartering Secure Against Active Adversaries
    Wueller, Stefan
    Meyer, Ulrike
    Wetzel, Susanne
    [J]. 2017 15TH ANNUAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST), 2017, : 205 - 214
  • [46] Two Cloud-assisted Over-threshold Multi-party Private Set Intersection Calculation Protocol
    Wei, Li-Fei
    Liu, Ji-Hai
    Zhang, Lei
    Ning, Jian-Ting
    [J]. Ruan Jian Xue Bao/Journal of Software, 2023, 34 (11): : 5442 - 5456
  • [47] Large-Scale Multi-party Counting Set Intersection Using a Space Efficient Global Synopsis
    Karapiperis, Dimitrios
    Vatsalan, Dinusha
    Verykios, Vassilios S.
    Christen, Peter
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2015, PT II, 2015, 9050 : 329 - 345
  • [48] Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries
    Pettai, Martin
    Laud, Peeter
    [J]. 2015 IEEE 28TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM CSF 2015, 2015, : 75 - 89
  • [49] Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries
    Appan, Ananya
    Chandramouli, Anirudh
    Choudhury, Ashish
    [J]. PROGRESS IN CRYPTOLOGY, INDOCRYPT 2022, 2022, 13774 : 223 - 248
  • [50] Nearly Optimal Protocols for Computing Multi-party Private Set Union
    Gong, Xuhui
    Hua, Qiang-Sheng
    Jin, Hai
    [J]. 2022 IEEE/ACM 30TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2022,