How do you find the intersection of two sets in a secured way?
Which means imagine a situation where there is a client who has got a set
S1={1,2,3}, and there is a server who has got a set S2[{2,3}. Client wants
to find the count of intersection which is |S1 intersection S2| = 2. But,
it doesn't want to give the set S1 directly to the server? How should the
client give the set S1, such that server computes the intersection of S1
and S2 and gives the count to client.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/xKZu8tmT8QEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
