Talk:Private set intersection

The example of hashing names and exchanging those digests is not private set intersection. Once a hospital sends their digest list to the other party that party can test if any name is in the first hospital's list. Even after the fact. A third party can do the same if they observe the exchange. That also enables someone to brute force names. It's feasible to recover 100% of the names because names are public information. (And is a fairly short list in terms of computing.) Only fake randomly generated names might be hard to recover. But those could be guessed fairly easily if they look like real names. Private set intersection requires that no one can learn something other than the intersection. The incorrect example is dangerously misleading.

Brandon Schneidtmille 5107 (talk) 14:08, 9 April 2020 (UTC)