.png){kind=icon}
返回
Efficient Threshold Private Set Intersection
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3048743.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Threshold private set intersection (TPSI) allows a receiver to obtain the intersection when the cardinality of the intersection is greater or equal to the threshold, which has a wide range of applications such as fingerprint matching, online dating and ridesharing. Existing TPSI protocols are inefficient because almost all of them rely on lots of expensive public-key techniques or require an exponential number of possible combinations among the shares. In this work, we design an efficient TPSI protocol, which achieves computational security in semi-honest model. To improve the efficiency of the TPSI protocol, we design a new TPSI protocol based on garbled Bloom filter (GBF) and threshold secret sharing, which uses a small amount of public-key operations. Moreover, our protocol combines with the Reed-Solomon decoding algorithm to reconstruct the secret which is a feasible method to avoid calculating all possible combinations among the shares. The performance analysis shows that our protocol is more efficient than the previous TPSI protocols. To the best of our knowledge, the optimal TPSI protocol implemented by Zhao and Chow (WPES'18) has an online time of 78 seconds to compute the intersection of two datasets of 100 elements each with threshold t=50. In contrast, our protocol has a total time of 2.988 seconds.
Keyword:
Garbled bloom filter
secure multiparty computation
threshold private set intersection
threshold secret sharing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Efficient Quantum Protocol for Private Set Intersection Cardinality私有集交集基数的高效量子协议.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容