Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF

TL;DR

This paper introduces a new ring-topology MPSI protocol based on multi-point sequential OPRF, significantly reducing communication and computation costs while maintaining security.

Contribution

It proposes a novel MP-SOPRF and a ring-topology MPSI protocol that addresses communication and computational challenges of existing methods.

Findings

Achieves 74.8% reduction in communication overhead.

Improves computational efficiency by 6% to 287%.

Proves semi-honest security under Hamming correlation robustness.

Abstract

Multiparty private set intersection (MPSI) allows multiple participants to compute the intersection of their locally owned data sets without revealing them. MPSI protocols can be categorized based on the network topology of nodes, with the star, mesh, and ring topologies being the primary types, respectively. Given that star and mesh topologies dominate current implementations, most existing MPSI protocols are based on these two topologies. However, star-topology MPSI protocols suffer from high leader node load, while mesh topology protocols suffer from high communication complexity and overhead. In this paper, we first propose a multi-point sequential oblivious pseudorandom function (MP-SOPRF) in a multi-party setting. Based on MP-SOPRF, we then develop an MPSI protocol with a ring topology, addressing the challenges of communication and computational overhead in existing protocols. We prove that our MPSI protocol is semi-honest secure under the Hamming correlation robustness assumption. Our experiments demonstrate that our MPSI protocol outperforms state-of-the-art protocols, achieving a reduction of 74.8% in communication and a 6% to 287% improvement in computational efficiency.