Is there an efficient solution? Finding the number of matching items in lists with a threshold
There has been work on finding the size of the set intersection. I haven't read this paper, but this would be a good place to start your research: Fast and Private Computation of Cardinality of Set Intersection and Union.