Efficient Threshold Private Set Intersection via BFV Fully Homomorphic Encryptions

ePrint Report: Efficient Threshold Private Set Intersection via BFV Fully Homomorphic Encryptions

JINGWEI HU

In this paper, we consider how to use fully homomorphic encryptions (FHEs) to solve the problem of secure computations over set intersection where one party holds a relatively set of size $N_s$ and the other party holds a relatively small set of size $N_r$ collaboratively compute some functionality over their set intersection without revealing other information. This problem has many applications for online collaboration, for example, …

bfv eprint report intersection party private private set intersection problem report size threshold