Multi-Party Privacy-Preserving Set Intersection With Quasi-Linear Complexity

Secure computation of the set intersection functionality allows n parties to find the intersection between their datasets without revealing anything else about them. An efficient protocol for such task could have multiple potential applications, in commerce, health-care, and security. However, all currently known secure set intersection protocols for n > 2 parties have computational costs that are quadratic in the (maximum) number of entries in the dataset contributed by each party, rendering secure computation of set intersection impractical on anything but small datasets.

Provided by: Seoul National University Topic: Security Date Added: Oct 2010 Format: PDF

Find By Topic