Efficient Unbalanced Quorum PSI from Homomorphic Encryption

Efficient Unbalanced Quorum PSI from Homomorphic Encryption

연구 분야: Cryptography

학회: ASIA CCS '24: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security

Multiparty private set intersection (mPSI) protocol is capable of finding the intersection of multiple sets securely without revealing any other information. However, its limitation lies in processing only those elements present in every participant's set, which proves inadequate in scenarios where certain elements are common to several, but not all, sets. In this paper, we introduce an innovative variant of the mPSI protocol named unbalanced quorum PSI to fill in the gaps of the mPSI protocol. Unlike the previous quorum-PSI proposals which detect elements present in at least k out of n equal sets, our protocol is particularly tailored for unbalanced cases where the size of the receiver's set is much smaller than the size of the senders' sets. Our work achieves logarithmic communication complexity in the semi-honest setting, significantly surpassing previous work in efficiency. The benchmarks show that it takes 22.7 seconds in WAN and 14.7 seconds in LAN for online computation, and only 87.8 MB of total communication to intersect 5535 elements across 15 sets, each containing 224 elements. Compared to prior work, this is roughly an 87× reduction in communication and a 31× reduction in online time. Our protocols can be easily extended to the larger set with 228 elements which is nearly impractical for prior work.