Corpus ID: 19081536

Fast and Fuzzy Private Set Intersection

  title={Fast and Fuzzy Private Set Intersection},
  author={Nicholas Kersting},
Private Set Intersection (PSI) is usually implemented as a sequence of encryption rounds between pairs of users, whereas the present work implements PSI in a simpler fashion: each set only needs to be encrypted once, after which each pair of users need only one ordinary set comparison. This is typically orders of magnitude faster than ordinary PSI at the cost of some ``fuzziness" in the matching, which may nonetheless be tolerable or even desirable. This is demonstrated in the case where the… Expand

Figures and Topics from this paper


On the performance of certain Private Set Intersection protocols. (And some remarks on the recent paper by Huang et al. in NDSS'12)
This paper considers one PSI construct from [DT10] and reports on its optimized implementation and performance evaluation, showing that the optimized implementation markedly outperforms the one presented in [HEK12]. Expand
Privacy-Preserving Set Operations
By building a framework of multiset operations, employing the mathematical properties of polynomials, this work designs efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. Expand
Private Intersection of Certified Sets
This paper introduces certified sets to the private set intersection problem, a trusted party ensures the inputs are valid and binds them to each participant, and improves existing malicious modelPrivate set intersection protocols by a constant factor. Expand
Practical Private Set Intersection Protocols with Linear Computational and Bandwidth Complexity
This paper explores some PSI variations and constructs several secure protocols that are appreciably more efficient than the state-of-the-art. Expand
Efficient Private Matching and Set Intersection
This work considers the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain, and presents protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments. Expand
When private set intersection meets big data: an efficient and scalable protocol
A new Private Set Intersection (PSI) protocol that is extremely efficient and highly scalable compared with existing protocols, based on a novel approach that is oblivious Bloom intersection, which has linear complexity and relies mostly on efficient symmetric key operations. Expand
Fast Sorted-Set Intersection using SIMD Instructions
This paper proposes a parallel algorithm that relies on speculative execution of comparisons of sorted-set intersection algorithms, which requires more comparisons but less instructions than scalar algorithms that translates into a better overall speed. Expand
Decoding billions of integers per second through vectorization
A novel vectorized scheme called SIMD‐BP128⋆ is introduced that improves over previously proposed vectorized approaches and is nearly twice as fast as the previously fastest schemes on desktop processors (varint‐G8IU and PFOR). Expand
Privacy-preserving matchmaking For mobile social networking secure against malicious users
  • Qi Xie, U. Hengartner
  • Computer Science
  • 2011 Ninth Annual International Conference on Privacy, Security and Trust
  • 2011
A privacy-preserving matchmaking protocol for mobile social networking that lets a potentially malicious user learn only the interests that he has in common with a nearby user, but no other interests is proposed. Expand
Privacy-Preserving Applications on Smartphones
The issues that make smartphones a unique platform for secure computation are introduced, some interesting potential applications are identified, and the initial experiences creating privacy-preserving applications on Android devices are described. Expand