Wednesday, December 11, 2019

Ask HN: Securely finding the intersection of two lists?

I've now three or four times run into the situation where I want to securely and privately find the intersection of a list I have, with a list someone else has – but without either of us seeing one another's full list.

For example, I want to find discover customers with a prospective partner. But they don't want to send us their complete customer list, and we don't want to send ours to them.

There is CS research into the topic of "Private Set Intersection Protocols", but I haven't found a working implementation. And I could pay an accounting or legal firm to do this manually, but that will cost more money and time than it's usually worth.

Have you ever heard of somebody doing an escrow service for this, where party A and party B each send their lists to the service, the esrvice verify the size of each list (so we're not just spamming the service), and then they send back the matches to both parties?


Comments URL: https://news.ycombinator.com/item?id=21768007

Points: 3

# Comments: 2



from Hacker News: Newest https://ift.tt/2RKcSg8
via IFTTT

No comments:

Post a Comment

MCP Discovery API – Let AI agents find the right tools automatically

Article URL: https://mcp-discovery-production.up.railway.app Comments URL: https://news.ycombinator.com/item?id=46661173 Points: 1 # Comm...