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 

Disruptive Technologies in Manufacturing (Opening Keynote)
Stephen Hoover
28 April 2015 | Seattle, WA
Conferences & Talks  

The First Five Kilobytes are the Hardest
George Dyson
29 April 2015 | George E. Pake Auditorium, PARC
PARC Forum  

Printed Hybrid Logic Circuits
Janos Veres
29 April 2015 | Berlin, Germany
Conferences & Talks  

IoT User Experience Design
Mike Kuniavsky
12 May 2015 | San Francisco, CA
Conferences & Talks  

CCNxCon 2015
Glenn Edens, Bill Janssen, Marc Mosko, Glenn Scott, Dick Sillman, Nacho Solis, Chris Wood, Yali Wang
18 May 2015 - 21 May 2015 | Palo Alto, CA
Conferences & Talks