A Scalable Private Data Alignment Scheme for Arbitrary Participants Using Oblivious PRF

Private data alignment, as the prerequisite for multiparty collaborative computation, attracts more attention in recent years, and some existing researches achieve the intersection sharing through two-party private set intersection (PSI) protocol based on various cryptographic techniques. However, they focus on the correctness and confidentiality of the protocol in the two-party scenario, while ignoring the efficiency and scalability in multiparty scenario. Additionally, the multiparty PSI protocol is difficult to be compatible with two parties simultaneously. To this end, we propose an oblivious pseudorandom function-based PSI scheme to achieve the data alignment, which is suitable for two parties and multiple parties. Specifically, to avoid frequent interactions among multiple parties, an efficient filtering algorithm is designed with the assistance of a server. The security proof for semi-honest and corrupted parties is provided, meanwhile, the computation and communication overhead analysis is given in detail. To evaluate the performance, we deploy the proposed scheme in two-party and multiparty scenario, and compare it with the existing protocols to discuss the execution complexity and overhead, which shows the efficiency and scalability of the proposed scheme in the multiparty scenario.