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

EVENT:

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

 

description

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 

Additive Manufacturing for Electronics “Beyond Moore”
Janos Veres
5 December 2016 | San Francisco, CA
Conferences & Talks  

Metamaterial Frequency-Adaptive Steerable Technology (M-FAST)
6 December 2016 - 8 December 2016 | London, United Kingdom
Conferences & Talks  

The Future of Work
Stephen Hoover
12 December 2016 | Stanford, CA
Conferences & Talks  

Connecting through Play: Tech to Augment In-Person Interaction
Katherine Isbister
15 December 2016 | George E. Pake Auditorium, PARC
PARC Forum