Efficient Multi-party Private Set Intersection with Constant Communication Rounds

This paper introduces a novel multi-party private set intersection (MPSI) protocol, enabling multiple parties to collaboratively compute the intersection of their input sets while ensuring no private information is disclosed. Our protocol mainly leverages efficient oblivious key-value store (OKVS) technique and symmetric-key operations, requiring only 3 rounds of interaction. We implement our protocol using various set sizes and numbers of parties, and the experimental results demonstrate that it surpasses the performance of existing state-of-the-art protocols.