Fast and Private Computation of Cardinality of Set Intersection and Union

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