home › event - fast and private computation of cardinality of set intersection and union


Fast and Private Computation of Cardinality of Set Intersection and Union
Conferences & Talks



In many everyday scenarios, sensitive information must be shared between parties without complete mutual trust. Private set operations are particularly useful to enable sharing information with privacy, as they allow two or more parties to jointly compute operations on their sets (e.g., intersection, union, etc.), such that only the minimum required amount of information is disclosed. In the last few years, the research community has proposed a number of secure and efficient techniques for Private Set Intersection (PSI), however, somewhat less explored is the problem of computing the magnitude, rather than the contents, of the intersection – we denote this problem as Private Set Intersection Cardinality (PSI-CA). This paper explores a few PSI-CA variations and constructs several protocols that are more efficient than the state-of-the-art.


upcoming events   view all 

The Experience When Business Meets Design
Brian Solis
27 October 2016
PARC Forum  

AI Case Studies: Pushing the Frontiers of Systems Engineering
Tolga Kurtoglu
9 November 2016 | San Francisco, CA
Conferences & Talks  

2016 AIChE Annual Meeting: Energy and Transport Processes
Corie L. Cobb
14 November 2016 - 15 November 2016 | San Francisco, CA
Conferences & Talks  

Printed Electronics USA 2016 - Visit PARC’s Booth #T20
Ross Bringans, Markus Larsson, Janos Veres
16 November 2016 - 17 November 2016 | Santa Clara, CA
Conferences & Talks