4.2 Article

Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity

期刊

SECURITY AND COMMUNICATION NETWORKS
卷 2022, 期 -, 页码 -

出版社

WILEY-HINDAWI
DOI: 10.1155/2022/9245516

关键词

-

资金

  1. National Natural Science Foundation of China [62172427]

向作者/读者索取更多资源

The MP-TPSI protocol allows multiple parties to jointly compute the intersection of their data sets while protecting individual private information, using TFHE and sparse polynomial interpolation to enhance security and computational efficiency.
Multiparty threshold private set intersection (MP-TPSI) protocol allows n mutually untrusted parties P-1, P-2, ... , P-n holding data sets A(1), A(2), ... , A(n) of size m respectively to jointly compute the intersection I = A(1) boolean AND A(2) boolean AND ... boolean AND A(n) over all their private data sets only if the size of intersection is larger than (m - t), while ensuring that no other private information of the data sets other than the intersection is revealed, where t is the threshold. In the MP-TPSI protocol, multiple parties first decide whether the size of the intersection is larger than the threshold t; then, they compute the intersection if the size of the intersection is larger than the threshold t. However, the existing MP-TPSI protocols use different forms of evaluation polynomials in the cardinality testing and intersection computing phases, so that parties need to transmit and calculate a large number of evaluation values, which leads to high communication and computational complexity. In addition, the existing MP-TPSI protocols cannot guarantee the security and the correctness of the results, that is, an adversary can know the additional information beyond the intersection, and the elements that are not in the intersection are calculated as the intersection. To solve these issues, based on the threshold fully homomorphic encryption (TFHE) and sparse polynomial interpolation, we propose an MP-TPSI protocol. In the star network topology, the theoretical communication complexity of the proposed MP-TPSI protocol depends on the threshold t and the number of parties n, not on the size of set m. Moreover, the proposed MP-TPSI protocol outperforms other related MP-TPSI protocols in terms of computational and communication overheads. Furthermore, the proposed MP-TPSI protocol tolerates up to n - 1 corrupted parties in the semi-honest model, where no set of colluding parties can learn the input of an honest party in the strictest dishonest majority setting.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据