Efficient circuit-based psi via cuckoo hashing

Benny Pinkas, Thomas Schneider, Christian Weinert, Udi Wieder

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

94 Scopus citations

Abstract

While there has been a lot of progress in designing efficient custom protocols for computing Private Set Intersection (PSI), there has been less research on using generic Multi-Party Computation (MPC) protocols for this task. However, there are many variants of the set intersection functionality that are not addressed by the existing custom PSI solutions and are easy to compute with generic MPC protocols (e.g., comparing the cardinality of the intersection with a threshold or measuring ad conversion rates). Generic PSI protocols work over circuits that compute the intersection. For sets of size n, the best known circuit constructions conduct$$O(n \log n)$$ or$$O(n \log n / \log \log n)$$ comparisons (Huang et al., NDSS’12 and Pinkas et al., USENIX Security’15). In this work, we propose new circuit-based protocols for computing variants of the intersection with an almost linear number of comparisons. Our constructions are based on new variants of Cuckoo hashing in two dimensions. We present an asymptotically efficient protocol as well as a protocol with better concrete efficiency. For the latter protocol, we determine the required sizes of tables and circuits experimentally, and show that the run-time is concretely better than that of existing constructions. The protocol can be extended to a larger number of parties. The proof technique presented in the full version for analyzing Cuckoo hashing in two dimensions is new and can be generalized to analyzing standard Cuckoo hashing as well as other new variants of it.

Original languageEnglish
Title of host publicationAdvances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings
EditorsJesper Buus Nielsen, Vincent Rijmen
PublisherSpringer Verlag
Pages125-157
Number of pages33
ISBN (Print)9783319783710
DOIs
StatePublished - 2018
Event37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018 - Tel Aviv, Israel
Duration: 29 Apr 20183 May 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10822 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018
Country/TerritoryIsrael
CityTel Aviv
Period29/04/183/05/18

Bibliographical note

Publisher Copyright:
© 2018, International Association for Cryptologic Research.

Keywords

  • Private set intersection
  • Secure computation

Fingerprint

Dive into the research topics of 'Efficient circuit-based psi via cuckoo hashing'. Together they form a unique fingerprint.

Cite this