Efficient Threshold Private Set Intersection

Threshold private set intersection (TPSI) allows a receiver to obtain the when cardinality of is greater or equal threshold, which has wide range applications such as fingerprint matching, online dating and ridesharing. Existing TPSI protocols are inefficient because almost all them rely on lots expensive public-key techniques require an exponential number possible combinations among shares. In this work, we design efficient protocol, achieves computational security in semi-honest model. To improve efficiency new protocol based garbled Bloom filter (GBF) threshold secret sharing, uses small amount operations. Moreover, our combines with Reed-Solomon decoding algorithm reconstruct feasible method avoid calculating The performance analysis shows that more than previous protocols. best knowledge, optimal implemented by Zhao Chow (WPES'18) time 78 seconds compute two datasets 100 elements each t = 50. contrast, total 2.988 seconds.