Mutual Private Set Intersection with Linear Complexity

摘要

A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs. While in its unilateral version only the client can obtain the intersection, the mutual PSI protocol en ables all players to get the desired result. In this work, we construct a mutual PSI protocol that is significantly more efficient than the state of-the-art in the computation overhead. To the best of our knowledge, our construction is the first result with linear computational complexity in the semi-honest model. For that, we come up with an efficient data representation technique, called prime representation.