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
mutually untrusted parties
holding data sets
of size
respectively to jointly compute the intersection
over all their private data sets only if the size of intersection is larger than
, while ensuring that no other private information of the data sets other than the intersection is revealed, where
is the threshold. In the MP-TPSI protocol, multiple parties first decide whether the size of the intersection is larger than the threshold
; then, they compute the intersection if the size of the intersection is larger than the threshold
. 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
and the number of parties
, not on the size of set
. 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
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
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篇论文的施引文献,订阅后可以查看论文全部施引文献