Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity

Author:

Yu Xiaopeng1ORCID,Li Fagen2ORCID,Zhao Wei1ORCID,Dai Zhengyi3ORCID,Tang Dianhua12ORCID

Affiliation:

1. Science and Technology on Communication Security Laboratory, Chengdu 610041, China

2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China

3. College of Computer, National University of Defense Technology, Changsha 410073, China

Abstract

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 A 2 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.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

Computer Networks and Communications,Information Systems

Reference51 articles.

1. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party;C. Meadows

2. Privacy preserving error resilient DNA searching through oblivious automata;J. R. Troncoso-Pastoriza

3. BotGrep: finding P2P bots with structured graph analysis;S. Nagaraja

4. PIR-PSI: Scaling Private Contact Discovery

5. Matching Secrets in the Absence of a Continuously Available Trusted Authority

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On the transient spatial localization model;High Energy Density Physics;2023-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3