An Efficient Multi-Party Private Set Intersection Protocol

Privacy Set Intersection (PSI) is an important Secure Multi-Party Computation (SMC) technique that allows participants to securely compute the intersection of their data sets without revealing any other information. To address the unfairness issues present in existing protocols, this paper proposes a fair multi-party PSI protocol based on Three-Hash Garbled Cuckoo Table (3H-GCT) and secret sharing. The protocol uses 3H-GCT as a data structure to store the data of each participant and employs secret sharing and share permutation techniques to protect data privacy, preventing the leakage of individual elements during the interaction. The core of the protocol lies in the cloud server performing bitwise XOR operations on the 3H-GCTs of each participant to compute the intersection, and then sending the intersecting 3H-GCT to all participants, ensuring the fairness of the protocol. Correctness analysis and security proofs show that the protocol is secure in a semi-honest environment. Experimental data indicates that the protocol has lower communication costs and computation time compared to existing protocols.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icicc63565.2024.10780695
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Multi-Party Private Set Intersection Protocol

Fangjie Wan, Chengqi Sun, Bing Hai
Cryptography and Data Security
article

An Efficient Multi-Party Private Set Intersection Protocol

Fangjie Wan, Chengqi Sun, Bing Hai
article en

Abstract

Privacy Set Intersection (PSI) is an important Secure Multi-Party Computation (SMC) technique that allows participants to securely compute the intersection of their data sets without revealing any other information. To address the unfairness issues present in existing protocols, this paper proposes a fair multi-party PSI protocol based on Three-Hash Garbled Cuckoo Table (3H-GCT) and secret sharing. The protocol uses 3H-GCT as a data structure to store the data of each participant and employs secret sharing and share permutation techniques to protect data privacy, preventing the leakage of individual elements during the interaction. The core of the protocol lies in the cloud server performing bitwise XOR operations on the 3H-GCTs of each participant to compute the intersection, and then sending the intersecting 3H-GCT to all participants, ensuring the fairness of the protocol. Correctness analysis and security proofs show that the protocol is secure in a semi-honest environment. Experimental data indicates that the protocol has lower communication costs and computation time compared to existing protocols.

Zhengzhou University (CN), China Construction Bank (CN)
Openalex Percentile: Top 79%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Efficient Multi-Party Private Set Intersection Protocol — Fangjie Wan, Chengqi Sun, et al. · (2024) | TGRS Research Map | TGRS